import java.io.FileWriter;
import java.io.IOException;

public class MergeSort {

private static long comparisons = 0;
private static long accesses = 0;

/*
* MergeSort method
*
*/
public static void sort(int[] array) {
sort(array, 0, array.length-1);
}

public static void merge(int array[], int left, int mid, int right) {
int index1 = mid - left + 1;
int index2 = right - mid;

int Larray[] = new int[index1];
int Rarray[] = new int[index2];

for (int i = 0; i < index1; ++i) {
accesses++;
Larray[i] = array[left + i];
}
for (int j = 0; j < index2; ++j) {
accesses++;
Rarray[j] = array[mid + 1 + j];
}

int i = 0;
int j = 0;

int k = left;
while (i < index1 && j < index2) {
comparisons++;
if (Larray[i] <= Rarray[j]) {
accesses++;
array[k] = Larray[i];
i++;
} else {
accesses++;
array[k] = Rarray[j];
j++;
}
k++;
}
while (i < index1) {
accesses++;
array[k] = Larray[i];
i++;
k++;
}
while (j < index2) {
accesses++;
array[k] = Rarray[j];
j++;
k++;
}
}

public static void sort(int array[], int left, int right) {
if (left < right) {
int mid = (left + right) / 2;
sort(array, left, mid);
sort(array, mid + 1, right);
merge(array, left, mid, right);
}
}

public static void main(String[] args) throws IOException {
String sortName = new ClassGetter().getClassName();
System.out.println(sortName + '\n');
FileWriter fwComparisons = new FileWriter(sortName + "_comparisons.csv");
fwComparisons.write("n,Iter 1,Iter 2,Iter 3,Iter 4,Iter 5,Iter 6,Iter 7,Iter 8,Iter 9, Iter 10,Avg.\n");
FileWriter fwAccesses = new FileWriter(sortName + "_accesses.csv");
fwAccesses.write("n,Iter 1,Iter 2,Iter 3,Iter 4,Iter 5,Iter 6,Iter 7,Iter 8,Iter 9, Iter 10,Avg.\n");
FileWriter fwDurations = new FileWriter(sortName + "_durations.csv");
fwDurations.write("n,Iter 1,Iter 2,Iter 3,Iter 4,Iter 5,Iter 6,Iter 7,Iter 8,Iter 9, Iter 10,Avg.\n");
int n = 1;
for (int row = 0; row < 5; row++) {
n *= 10;
System.out.println("n = " + n);
fwComparisons.write(n + ",");
fwAccesses.write(n + ",");
fwDurations.write(n + ",");
long totalComparisons = 0l;
long totalAccesses = 0l;
long totalDuration = 0l;
for (int col = 0; col < 10; col++) {
int[] array = RandomArray.randomArray(n);
long start = System.nanoTime();
comparisons = 0;
accesses = 0;
// Call sorting method
sort(array);
long finish = System.nanoTime();
long duration = (finish - start);
System.out.println(comparisons + " comparisons, " + accesses + " accesses, " + duration + " duration");
fwComparisons.write(comparisons + ",");
fwAccesses.write(accesses + ",");
fwDurations.write(duration + ",");
totalComparisons += comparisons;
totalAccesses += accesses;
totalDuration += duration;
}
long averageComparisons = totalComparisons / 10;
long averageAccesses = totalAccesses / 10;
long averageDuration = totalDuration / 10;
System.out.println("Average:");
System.out.println(averageComparisons + " comparisons, " + averageAccesses + " accesses, " + averageDuration
+ " duration");
fwComparisons.write(averageComparisons + "\n");
fwAccesses.write(averageAccesses + "\n");
fwDurations.write(averageDuration + "\n");
}
fwComparisons.close();
fwAccesses.close();
fwDurations.close();
System.out.println('\n');
System.out.println("Comparisons written to " + sortName + "_comparisons.csv");
System.out.println("Accesses written to " + sortName + "_accesses.csv");
System.out.println("Durations written to " + sortName + "_durations.csv");
}

}

Problem Statement A parking garage charges a $2.00 minimum fee t...