diff --git a/Sorting_Searching/insertionsort.py b/Sorting_Searching/insertionsort.py
new file mode 100644
index 0000000..0cb7bff
--- /dev/null
+++ b/Sorting_Searching/insertionsort.py
@@ -0,0 +1,26 @@
+def insertion_sort(array):
+
+    # We start from 1 since the first element is trivially sorted
+    for index in range(1, len(array)):
+        currentValue = array[index]
+        currentPosition = index
+
+        
+        while currentPosition > 0 and array[currentPosition - 1] > currentValue:
+            array[currentPosition] = array[currentPosition -1]
+            currentPosition = currentPosition - 1
+
+
+
+        array[currentPosition] = currentValue
+        print("array now : ")
+        print(array)
+array = []
+n = int(input("Enter number of elements : ")) 
+for i in range(0, n): 
+    ele = int(input()) 
+  
+    array.append(ele) # adding the element 
+
+insertion_sort(array)
+print("sorted array: " + str(array))