Added implementation of Sorting algorithms

karthiks2611 · web-flow · commit 9b0232354f37 · 2021-10-30T12:49:52.000+05:30
diff --git a/Data Structures and Algorithms/Insertion_sort.py b/Data Structures and Algorithms/Insertion_sort.py
@@ -0,0 +1,18 @@
+
+def insertionSort(Array):
+    for i in range(1, len(Array)):
+        key = Array[i]
+        j = i - 1
+
+        # Compare key with each element on the left of it until an element
+        #  smaller than it is found
+        # For descending order, change key<Array[j] to key>Array[j].
+        while j >= 0 and key < Array[j]:
+            Array[j + 1] = Array[j]
+            j -= 1
+        Array[j + 1] = key
+    return Array
+
+if __name__ == '__main__':
+    Array = [-2, -3, -1, 11, 9, 12, 4, -5, -12, 6, 19, 20]
+    print(insertionSort(Array))
