Insertion Sort

Author: akashdip2001

DSA/B03_Insertion_Sort.java

@@ -0,0 +1,30 @@
+package com.akashdipmahapatra.DSA;
+
+public class B03_Insertion_Sort {
+
+    public static void main(String[] args) {
+
+        int arr[] = {6, 5, 2, 8, 9, 7};
+
+
+
+        // Insertion Sort
+        for(int i=1; i<arr.length; i++){
+
+            int key = arr[i];
+            int j = i-1;
+
+            while(j>0 && arr[j]>key){
+                arr[j+1] = arr[j];
+                j--;
+            }
+            arr[j+1]= key;
+        }
+
+
+
+        for(int num : arr){
+            System.out.print(num+" ");
+        }
+    }
+}

DSA/README.md

@@ -226,3 +226,8 @@ Recursive Binary Search uses extra memory for **function call stack** (because e
 ```
 
 - Selection Short
+
+<img src="../img/Selection%20Short.png">
+
+- Insertion Sort
+> It's actually not `Swapping` but actully `Shifting`. completely take out all values and put into the array again in right order.