Modify the sort algorithms discusses in the class (selection,

insertion, bubble, quick, and merge) by adding code to each tally the

total

number of comparisons

and

total execution time

of each algorithm. Compare

all the algorithms against the same list. Prepare a table with total number of

comparisons and total execution time for each algorithm. Try at least

5 different

lists

, including at least one that is already in sorted order.

-----------------

(Java code that needs to be modified)

public class Sorting { public static > void selectionSort(T[] data) { int min; T temp; for (int index = 0; index < data.length-1; index++) { min = index; for(int scan = index + 1; scan < data.length; scan++) if(data[scan].compareTo(data[min]) < 0) min = scan; swap(data, min, index); } } public static > void swap(T[] data, int index1, int index2) { T temp = data[index1]; data[index1] = data[index2]; data[index2] = temp; } public static > void insertionSort(T[] data) { for (int index = 1; index < data.length; index++) { T key = data[index]; int position = index; while(position > 0 && data[position-1].compareTo(key) > 0) { data[position] = data[position-1]; position --; } data[position] = key; } } public static > void bubbleSort(T[] data) { int position, scan; T temp; for(position = data.length-1; position >= 0; position--) { for(scan = 0; scan <= position-1; scan++) { if(data[scan].compareTo(data[scan+1]) > 0) swap(data, scan, scan+1); } } } public static > void quickSort(T[] data) { quickSort(data, 0, data.length-1); } public static > void quickSort(T[] data, int min, int max) { if(min < max) { int indexOfPartition = partition(data, min, max); quickSort(data, min, indexOfPartition - 1); quickSort(data, indexOfPartition + 1, max); } } public static > int partition(T[] data, int min, int max) { T partitionElement; int left, right; int middle = (min + max)/2; partitionElement = data[middle]; swap(data, middle, min); left = min; right = max; while(left < right) { while(left < right && data[left].compareTo(partitionElement) <= 0) { left++; } while (data[right].compareTo(partitionElement) > 0) right--; if(left < right) swap(data, left, right); } swap(data, min, right); return right; } public static > void mergeSort(T[] data) { mergeSort(data, 0, data.length -1); } public static > void mergeSort(T[] data, int min, int max) { if(min < max) { int mid = (min + max)/2; mergeSort(data, min, mid); mergeSort(data, mid+1, max); merge(data, min, mid, max); } } public static > void merge(T[] data, int first, int mid, int last) { T[] temp = (T[]) (new Comparable[data.length]); int first1 = first, last1 = mid; int first2 = mid + 1, last2 = last; int index = first1; while(first1 <= last1 && first2 <= last2) { if(data[first1].compareTo(data[first2]) < 0) { temp[index] = data[first1]; first1++; } else { temp[index] = data[first2]; first2++; } index++; } while (first1 <= last1) { temp[index] = data[first1]; first1++; index++; } while(first2 <= last2) { temp[index] = data[first2]; first2++; index++; } for(index = first; index <= last; index++) data[index] = temp[index]; } }