Compare selection sort, insertion sort, shell sort, merge sort, and quick sort.

Your results should include:

A neatly formatted table of swaps and compares for each sort. A discussion of the results you received, including your choice for the best sorting algorithm and why you chose it. A prediction for swap and compare values for each sort on a file size that is approximately 2.5 times as large as the file provided in class.