This class implements six different comparison sorts (and an optional
seventh sort for extra credit):
selection sort
insertion sort
merge sort
quick sort
heap sort
selection2 sort
(extra credit) insertion2 sort
It also has a method that runs all the sorts on the same input array and
prints out statistics.
Sorts the given array using the quick sort algorithm, using the median of
the first, last, and middle values in each segment of the array as the
pivot value.