add insert sort implemention with Java

Author: Huson-Q

src/java/lib/hamcrest-core-1.3.jar

@@ -0,0 +1,24 @@
+package huson;
+
+import java.util.Arrays;
+
+public class InsertionSort implements ISort
+{
+    @Override
+    public int[] sort(int[] arr)
+    {
+        int[] result = Arrays.copyOf(arr, arr.length);
+        for (int i = 1; i < result.length; i++) {
+            int insertValue = result[i];
+            int j = i;
+            while (j > 0 && insertValue < result[j - 1] ) {
+                result[j] = result[j - 1];
+                j--;
+            }
+            if (j != i) {
+                result[j] = insertValue;
+            }
+        }
+        return result;
+    }
+}

src/java/lib/junit-4.12.jar

@@ -1,4 +1,5 @@
 import huson.BubbleSort;
+import huson.InsertionSort;
 import huson.SelectionSort;
 import org.junit.After;
 import org.junit.Assert;
@@ -47,6 +48,14 @@ public void testSelectionSort()
         Assert.assertArrayEquals(sortedArray, new SelectionSort().sort(array));
     }
 
+    @Test
+    public void testInsertionSort()
+    {
+        System.out.println("sortedArray = \n" + Arrays.toString(sortedArray));
+        System.out.println("selectionSortedArray = \n" + Arrays.toString(new InsertionSort().sort(array)));
+        Assert.assertArrayEquals(sortedArray, new InsertionSort().sort(array));
+    }
+
     private int[] generateRandomArray(int number, int min, int max)
     {
         int[] result = new int[number];