insertion sorting algorithm

Author: Sagar-Sharma-7

algorithms/app2.py

@@ -11,4 +11,5 @@
     if f == True:
         l[i], l[min] = l[min], l[i]
         print(l)
-         
+         
+print("Sorted list: ", l)

algorithms/app3.py

@@ -0,0 +1,13 @@
+# Insertion sorting
+l = eval(input("Enter your number list: "))
+n = len(l)
+for i in range(n):
+    t = l[i]
+    k = i - 1
+    while k >=0 and l[k] > t:
+        l[k + 1] = l[k]
+        k = k- 1
+    l[k + 1] = t
+    print(l)
+
+print("Sorted list: ", l)