IN JAVA

Can you identify where in the code comparisons are actually made? Modify QuickSort2.java to count the number of comparisons. Then plot the results along with the other sort algorithms in Exercise 5 above.

import java.util.*; public class QuickSort2 { public static void main (String[] argv) { int[] testData = makeRandomArray (10); System.out.println ("Before: " + Arrays.toString(testData)); quickSort (testData); System.out.println ("After: " + Arrays.toString(testData)); } static void quickSort (int[] A) { quickSortRecursive (A, 0, A.length-1); } static void quickSortRecursive (int[] data, int left, int right) { if (left < right) { // Partition to find the "right place" for the leftmost element. int partitionPosition = quickSortPartition (data, left, right); // Recurse on the left side: quickSortRecursive (data, left, partitionPosition-1); // Recurse on the right side: quickSortRecursive (data, partitionPosition+1, right); } // Else: left==right so we're done. } static int quickSortPartition (int[] data, int left, int right) { if (left == right) return left; int partitionElement = data[right]; int currentSwapPosition = right; for (int i=right-1; i>=left; i--) { // Examine everything between left and right-1 inclusive. if (data[i] > partitionElement) { // Switch with swap position currentSwapPosition--; swap (data, currentSwapPosition, i); // Shift swap position rightwards: } } // Last one: swap (data, currentSwapPosition, right); return currentSwapPosition; } static void swap (int[] data, int i, int j) { int temp = data[i]; data[i] = data[j]; data[j] = temp; } static int[] makeRandomArray (int length) { int[] A = new int [length]; for (int i=0; i