efischer/Tutoring-APCompSci
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

remove old code

Browse Source
This commit is contained in:
Eugene Fischer
2020-06-11 12:25:46 -05:00
parent 3ac8c7e315
commit 50506d4465
1 changed files with 0 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
Sorting/MergeSorter.java
View File

@@ -32,42 +32,30 @@ public class MergeSorter extends Sorter{
Integer[] right=new Integer[sizeRight]; Integer[] right=new Integer[sizeRight];
for(int i=0;i<sizeLeft;i++){ for(int i=0;i<sizeLeft;i++){
writeToArray(left, i, numbers[leftIndex+i]); writeToArray(left, i, numbers[leftIndex+i]);
//left[i]=numbers[leftIndex+i];
//writesUsed++;
} }
for(int i=0;i<sizeRight;i++){ for(int i=0;i<sizeRight;i++){
writeToArray(right, i, numbers[middleIndex+1+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 i=0, j=0;//indices of left and right array
int k=leftIndex;//index of numbers array int k=leftIndex;//index of numbers array
while(i<sizeLeft&&j<sizeRight){ while(i<sizeLeft&&j<sizeRight){
if(compare(left[i],right[j])<1){ if(compare(left[i],right[j])<1){
writeToArray(numbers, k, left[i]); writeToArray(numbers, k, left[i]);
//numbers[k]=left[i];
//writesUsed++;
i++; i++;
} }
else{ else{
writeToArray(numbers, k, right[j]); writeToArray(numbers, k, right[j]);
//numbers[k]=right[j];
//writesUsed++;
j++; j++;
} }
k++; k++;
} }
while(i<sizeLeft){ while(i<sizeLeft){
writeToArray(numbers, k, left[i]); writeToArray(numbers, k, left[i]);
//numbers[k]=left[i];
//writesUsed++;
i++; i++;
k++; k++;
} }
while(j<sizeRight){ while(j<sizeRight){
writeToArray(numbers, k, right[j]); writeToArray(numbers, k, right[j]);
//numbers[k]=right[j];
//writesUsed++;
j++; j++;
k++; k++;
} }