From 50506d44655e8ffed5703a8dc6a73cde523106ce Mon Sep 17 00:00:00 2001
From: Eugene Fischer <ej@eugenefischer.com>
Date: Thu, 11 Jun 2020 12:25:46 -0500
Subject: [PATCH] remove old code

---
 Sorting/MergeSorter.java | 12 ------------
 1 file changed, 12 deletions(-)

diff --git a/Sorting/MergeSorter.java b/Sorting/MergeSorter.java
index a426a26..045c993 100644
--- a/Sorting/MergeSorter.java
+++ b/Sorting/MergeSorter.java
@@ -32,42 +32,30 @@ public class MergeSorter extends Sorter{
         Integer[] right=new Integer[sizeRight];
         for(int i=0;i<sizeLeft;i++){
             writeToArray(left, i, numbers[leftIndex+i]);
-            //left[i]=numbers[leftIndex+i];
-            //writesUsed++;
         }
         for(int i=0;i<sizeRight;i++){
             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){
                 writeToArray(numbers, k, left[i]);
-                //numbers[k]=left[i];
-                //writesUsed++;
                 i++;
             }
             else{
                 writeToArray(numbers, k, right[j]);
-                //numbers[k]=right[j];
-                //writesUsed++;
                 j++;
             }
             k++;
         }
         while(i<sizeLeft){
             writeToArray(numbers, k, left[i]);
-            //numbers[k]=left[i];
-            //writesUsed++;
             i++;
             k++;
         }
         while(j<sizeRight){
             writeToArray(numbers, k, right[j]);
-            //numbers[k]=right[j];
-            //writesUsed++;
             j++;
             k++;
         }