diff --git a/Insertion_Sort/Insertion_Sort.py b/Insertion_Sort/Insertion_Sort.py
new file mode 100644
index 0000000..b5a84a0
--- /dev/null
+++ b/Insertion_Sort/Insertion_Sort.py
@@ -0,0 +1,19 @@
+# Python program for implementation of Insertion Sort 
+
+def insertionSort(arr): 
+
+	for i in range(1, len(arr)): 
+
+		key = arr[i]               # Move elements of arr that are greater than key, to one position ahead of their current position                     
+		j = i-1
+		while j >= 0 and key < arr[j] : 
+				arr[j + 1] = arr[j] 
+				j -= 1
+		arr[j + 1] = key 
+
+print("Enter the array elements : ")
+arr = list(map(int,input().split()))
+insertionSort(arr) 
+print ("\nSorted array is ",str(arr)) 
+
+