diff --git a/Sorting/MergeSorter.java b/Sorting/MergeSorter.java
index 08f6d38..15c4abe 100644
--- a/Sorting/MergeSorter.java
+++ b/Sorting/MergeSorter.java
@@ -28,41 +28,46 @@ public class MergeSorter extends Sorter{
     void merge(int leftIndex, int middleIndex, int rightIndex){
         int sizeLeft=middleIndex-leftIndex+1;//add 1 to include both endpoints
         int sizeRight=rightIndex-middleIndex;//both endpoints already included, as middleIndex is part of left array
-        int[] left=new int[sizeLeft];
-        int[] right=new int[sizeRight];
+        Integer[] left=new Integer[sizeLeft];
+        Integer[] right=new Integer[sizeRight];
         for(int i=0;i<sizeLeft;i++){
-            left[i]=numbers[leftIndex+i];
-            writesUsed++;
+            writeToArray(left, i, numbers[leftIndex+i]);
+            //left[i]=numbers[leftIndex+i];
+            //writesUsed++;
         }
         for(int i=0;i<sizeRight;i++){
-            right[i]=numbers[middleIndex+1+i];
-            writesUsed++;
+            writeToArray(right, i, numbers[middleIndex+1+i]);
+            //right[i]=numbers[middleIndex+1+i];
+            //writesUsed++;
         }
         int i=0, j=0;//indices of left and right array
         int k=leftIndex;//index of numbers array
         while(i<sizeLeft&&j<sizeRight){
             if(compare(left[i],right[j])<1){
-                numbers[k]=left[i];
-                writesUsed++;
-
+                writeToArray(numbers, k, left[i]);
+                //numbers[k]=left[i];
+                //writesUsed++;
                 i++;
             }
             else{
-                numbers[k]=right[j];
-                writesUsed++;
+                writeToArray(numbers, k, right[i]);
+                //numbers[k]=right[j];
+                //writesUsed++;
                 j++;
             }
             k++;
         }
         while(i<sizeLeft){
-            numbers[k]=left[i];
-            writesUsed++;
+            writeToArray(numbers, k, left[i]);
+            //numbers[k]=left[i];
+            //writesUsed++;
             i++;
             k++;
         }
         while(j<sizeRight){
-            numbers[k]=right[j];
-            writesUsed++;
+            writeToArray(numbers, k, right[j]);
+            //numbers[k]=right[j];
+            //writesUsed++;
             j++;
             k++;
         }