Done

src/main/java/com/zipcodewilmington/arrayutility/ArrayUtility.java

@@ -15,32 +15,6 @@ public class ArrayUtility<S> {
         this.newlist.addAll(Arrays.asList(inputArray));
         //S[] temp = (S[]) new Object[length];(creating a new generic array)
     }
-    public Integer countDuplicatesInMerge(S[] inputArray, S valueToEvaluate ) {
-        Integer count=0;
-        newlist.addAll(Arrays.asList(inputArray));
-        for (S element : newlist) {
-            if(element.equals(valueToEvaluate))
-            {
-                count++;
-            }
-        }
-        return count;
-    }
-
-    public S getMostCommonFromMerge(S[] inputArray)
-    {
-        S mostcommonElement=inputArray[0];
-        int mostcommonElementOccurences=0;
-        for(S element :newlist)
-        {
-            if(getNumberOfOccurrences(element)>mostcommonElementOccurences)
-            {
-                mostcommonElement=element;
-                mostcommonElementOccurences=getNumberOfOccurrences(element);
-            }
-        }
-        return mostcommonElement;
-    }
     public int getNumberOfOccurrences(S valueToEvaluate)
     {
         int countOccurence=0;
@@ -71,4 +45,31 @@ public class ArrayUtility<S> {
 
     }
 
+    public Integer countDuplicatesInMerge(S[] inputArray, S valueToEvaluate ) {
+        Integer count=0;
+        newlist.addAll(Arrays.asList(inputArray));
+        for (S element : newlist) {
+            if(element.equals(valueToEvaluate))
+            {
+                count++;
+            }
+        }
+        return count;
+    }
+
+    public S getMostCommonFromMerge(S[] inputArray)
+    {
+        S mostcommonElement=inputArray[0];
+        int mostcommonElementOccurences=0;
+        for(S element :newlist)
+        {
+            if(getNumberOfOccurrences(element)>mostcommonElementOccurences)
+            {
+                mostcommonElement=element;
+                mostcommonElementOccurences=getNumberOfOccurrences(element);
+            }
+        }
+        return mostcommonElement;
+    }
+
 }