Create InsertionSort.py

MeenakshyBS · web-flow · commit a318f0883b71 · 2022-10-05T16:10:16.000+05:30
Insertion Sort Implementation In Python
In order to rank an array of size N ascendingly:
Over the array, iterate from arr[1] to arr[N].
Comparing the current (key) element to the previous one.
Compare the key element to the previous elements to see if it is smaller. In order to make room for the substituted element, move the larger elements up one position.
diff --git a/InsertionSort.py b/InsertionSort.py
@@ -0,0 +1,17 @@
+def insertion_sort(arr):
+
+    for i in range(1, len(arr)):
+        key = arr[i]
+        j = i - 1
+                
+        while j >= 0 and key < arr[j]:
+            arr[j + 1] = arr[j]
+            j = j - 1
+            
+       
+        arr[j + 1] = key
+
+arr = [9, 8, 6, 7, 1]
+print("Unsorted Array:", arr)
+insertion_sort(arr)
+print('Sorted Array: ', arr)
