Question: Modify quick sorting algorithm so that it keeps track of the number of comparisons it performs and the number of exchanges (swaps) it performs during a single sorting operation. Keep track of these numbers using two long integer counters; one to keep track of the number of comparisons and another to keep track of the number of swaps

Algorithm for QuickSort:

import java.util.Random;

public class QuickSort {

private int[] data;

private static Random generator = new Random();

public QuickSort( int size ) {

data = new int[ size ]; // create space for array

for ( int i = 0; i < size; i++ )

data[ i ] = 10 + generator.nextInt( 90 );

}

// call this method from the main program

public void sort() {

quickSortHelper( 0, data.length - 1 );

}

private void quickSortHelper( int left, int right ) {

int pivot = partition( left, right );

if ( left < pivot - 1 )

quickSortHelper( left, pivot - 1 );

if ( pivot + 1 < right )

quickSortHelper( pivot + 1, right );

}

private int partition( int left, int right ) {

int pivot = left;

while ( true ) {

while ( data[ right ] >= data[ pivot ] ) {

if ( right == pivot )

return pivot;

--right;

}

swap( pivot, right );

pivot = right--;

while ( data[ left ] <= data[ pivot ] ) {

if ( left == pivot )

return pivot;

++left;

}

swap( pivot, left );

pivot = left++;

}

}

private void swap( int first, int second ) {

int temporary = data[ first ];

data[ first ] = data[ second ];

data[ second ] = temporary;

}

}