diff --git a/Python/insertion_sort.py b/Python/insertion_sort.py
new file mode 100644
index 0000000..c14e826
--- /dev/null
+++ b/Python/insertion_sort.py
@@ -0,0 +1,25 @@
+# Python program for implementation of Insertion Sort 
+  
+# Function to do insertion sort 
+def insertionSort(arr): 
+  
+    # Traverse through 1 to len(arr) 
+    for i in range(1, len(arr)): 
+  
+        key = arr[i] 
+  
+        # Move elements of arr[0..i-1], 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 
+  
+  
+# Driver code to test above 
+arr = [12, 11, 13, 5, 6] 
+insertionSort(arr) 
+for i in range(len(arr)): 
+    print ("% d" % arr[i])