Project 1
ITCS 6114/8114 Spring 2009
Due February 23
Implement the following improvements to the Quick Sort and find out the percentage
of key comparisons that can be saved in each case. Using randomly generated 1000
integers as input for sorting. Repeat the experiments 1000 times for each case to get the
average percentage reduction in key comparisons.
Case 1) Median of Three Partition
Case 2) Sort partition of size less than 16 directly using Insertion Sort
Case 3) Combine both techniques above.