Insertion Sort

Author: jszlenk

README.md

@@ -22,5 +22,14 @@ Algorithms:
   -  **[Bubble Sort](https://github.com/jszlenk/Algorithms-and-Data-Structures-in-Java/tree/master/SortAlgorithms/src/BubbleSort)**
   -  **[Selection Sort](https://github.com/jszlenk/Algorithms-and-Data-Structures-in-Java/tree/master/SortAlgorithms/src/SelectionSort)**
   - Insertion Sort
+  - Shell Sort
+  - Merge Sort
+  - Quick Sort
+  - Counting Sort
+  - Radix Sort
+  - Sorting Arrays Using the JDK
+  
+  
+- Recursion  
 
 

SortAlgorithms/src/InsertionSort/InsertionSort.java

@@ -0,0 +1,17 @@
+package InsertionSort;
+
+class InsertionSort {
+
+    static void insertion(int[] intArray) {
+        for (int firstIndex = 1; firstIndex < intArray.length; firstIndex++) {
+            int newElement = intArray[firstIndex];
+
+            int i;
+            for (i = firstIndex; i > 0 && intArray[i - 1] > newElement; i--) {
+                intArray[i] = intArray[i - 1];
+            }
+
+            intArray[i] = newElement;
+        }
+    }
+}

SortAlgorithms/src/InsertionSort/Main.java

@@ -0,0 +1,16 @@
+package InsertionSort;
+
+import static InsertionSort.InsertionSort.insertion;
+
+public class Main {
+    public static void main(String[] args) {
+
+        int[] intArray = {25, 0, -8, -15, -4, 22, 7, 7, 1, -22, 14, 1};
+
+        insertion(intArray);
+
+        for (int anIntArray : intArray) {
+            System.out.println(anIntArray);
+        }
+    }
+}