anuraghcoder23
diff --git a/‎lectures/11-sorting/Insertion Sort.pdf
1.25 MB b/‎lectures/11-sorting/Insertion Sort.pdf
1.25 MB
diff --git a/‎lectures/11-sorting/code/src/com/kunal/Main.java
Lines changed: 14 additions & 2 deletions b/‎lectures/11-sorting/code/src/com/kunal/Main.java
Lines changed: 14 additions & 2 deletions
@@ -5,11 +5,23 @@
 public class Main {
 
     public static void main(String[] args) {
-        int[] arr = {4, 5, 1, 2, 3};
-        selection(arr);
+        int[] arr = {5, 3, 4, 1, 2};
+        insertion(arr);
         System.out.println(Arrays.toString(arr));
     }
 
+    static void insertion(int[] arr) {
+        for (int i = 0; i < arr.length - 1; i++) {
+            for (int j = i+1; j > 0; j--) {
+                if (arr[j] < arr[j-1]) {
+                    swap(arr, j, j-1);
+                } else {
+                    break;
+                }
+            }
+        }
+    }
+
     static void selection(int[] arr) {
         for (int i = 0; i < arr.length; i++) {
             // find the max item in the remaining array and swap with correct index