implementing Shuffle

Author: codelogicws

out/production/Algorithms/ws/codelogic/algorithms/shuffle/Shuffler.class

@@ -0,0 +1,8 @@
+package ws.codelogic.algorithms.shuffle;
+
+public class Shuffler {
+
+    public int[] shuffle(int[] sorted) {
+        return new int[4];
+    }
+}

out/production/Algorithms/ws/codelogic/algorithms/shuffle/ShufflerTest.class

@@ -0,0 +1,37 @@
+package ws.codelogic.algorithms.shuffle;
+
+import static org.junit.Assert.*;
+import org.junit.Before;
+import org.junit.Test;
+
+public class ShufflerTest {
+
+    private Shuffler shuffler;
+    private int[] sorted = {1,2,3,4,5,6,7,8,9};
+
+    @Before
+    public void setup() {
+        shuffler = new Shuffler();
+    }
+
+    @Test
+    public void testItemsAreNotInTheSortedOrderTheyWhereSentIn() {
+        int[] shuffled = shuffler.shuffle(sorted);
+        assertFalse(arraysNotEqual(shuffled, sorted));
+    }
+
+    private boolean arraysNotEqual(int[] array1, int[] array2){
+        boolean arraysEqual = true;
+        if(array1.length != array2.length){
+            arraysEqual = false;
+        }else{
+            for(int i=0;i<array1.length;i++){
+                if(array1[i] != array2[i]){
+                    arraysEqual = false;
+                    break;
+                }
+            }
+        }
+        return arraysEqual;
+    }
+}

out/production/Algorithms/ws/codelogic/test/TestSuite.class

@@ -6,6 +6,7 @@
 import ws.codelogic.algorithms.Stack.LinkStackTest;
 import ws.codelogic.algorithms.arithmetic.evaluation.DijkstrasTwoStackTest;
 import ws.codelogic.algorithms.search.SearchTest;
+import ws.codelogic.algorithms.shuffle.Shuffler;
 import ws.codelogic.algorithms.sort.InsertionSortTest;
 import ws.codelogic.algorithms.sort.SelectionSortTest;
 import ws.codelogic.algorithms.sort.ShellSort;
@@ -21,6 +22,7 @@
         ShellSortTest.class,
         DijkstrasTwoStackTest.class,
         ArrayStackTest.class,
+//        Shuffler.class,
         LinkStackTest.class})
 public class TestSuite {
 }