Insertion Sort

ChaitanyaD48 · web-flow · commit e7e85f8033ee · 2022-10-19T00:21:37.000+05:30
This code sorts the input array based using the Insertion Sort algorithm. Insertion Sort has Time Complexity: O(N^2) and Auxiliary Space: O(1).
diff --git a/InsertionSort.cpp b/InsertionSort.cpp
@@ -0,0 +1,17 @@
+void insertionSort(int *input, int size)
+{
+    int i, key, j;
+    for (i = 1; i < size; i++)
+    {
+        key = input[i];
+        j = i - 1;
+ 
+       
+        while (j >= 0 && input[j] > key)
+        {
+            input[j + 1] = input[j];
+            j = j - 1;
+        }
+        input[j + 1] = key;
+    }
+}
