Merge pull request kennyledet#479 from darubramha89/java-branch

Stooge Sort Java Implementation

Stooge_Sort/Java/darubramha89/StoogeSort.java

@@ -0,0 +1,28 @@
+package stooge.sort;
+
+public class StoogeSort {
+
+  public int[] sort(int input[])
+  {
+    return stoogesort(input, 0, input.length-1);
+  }
+
+  public int[] stoogesort(int input[], int i, int j)
+  {
+
+    if(input[j] < input[i])
+    {
+      int temp = input[i];
+      input[i] = input[j];
+      input[j] = temp;
+    }
+    if((j-i+1) > 2)
+    {
+      int temp = (j- i + 1)/3;
+      stoogesort(input, i, j-temp);
+      stoogesort(input, i+temp, j);
+      stoogesort(input, i, j-temp);
+    }
+    return input;
+  }
+}

Stooge_Sort/Java/darubramha89/StoogeSort_test.java

@@ -0,0 +1,21 @@
+package stooge.sort;
+
+import static org.junit.Assert.*;
+
+import org.junit.Test;
+
+public class StoogeSort_test {
+
+  @Test
+  public void test() {
+
+    int expected[] = {1,1,2,2,3,3,4,5,5,7,88 };
+    int input[] = {2,4,1,5,3,88,5,3,7,2,1};
+
+    StoogeSort ss = new StoogeSort();
+    assertArrayEquals("Both arrays should match and give sorted results",expected, ss.sort(input));
+    assertArrayEquals("Both arrays should match and give sorted results",expected, ss.sort(expected));
+
+  }
+
+}