Assignment 6

This assignment is worth 35 points.

Extend your testbed to include quick, merge and insertion sorts.

When you have finished this assignment, you should have:

• Developed a testbed for examining the empirical efficiency of sorting algorithms.
• Implemented several additional sorting algorithms.
• Experienced collecting and interpreting data related to the empirical performance of algorithms.
• Experienced the difference in O(n²) and O(n lg(n)) algorithsms.

• Generate a randomized array of a given size.
• Call each sorting algorithm on an unsorted copy of the array, and record the system time consumed.
• Check the results of the sort algorithm to assure
  • The final array is sorted.
  • The elements in the sorted array match those of the original array.

Once your framework is established, you should test each sorting routine ten times various sizes of input.

Implement insertion sort, quick sort and merge sort. In addition, for either quicksort or merge sort (or both) , implement a modified version which will call an O(n²) sort when the size of the list to be sorted reaches a limt.

Produce a report which

• Describes each of the new sorts tested.
• Describes the conditions of the test.
• Describes the relative performance of all sorts.
• Explains the difference in performance of the sorts.

You should provide a number of graphs to allow the reader to fully interpret your results. This somewhat depends on your data.

You should make your framework flexible, as you will be adding additional sorts to this as the semester passes.

For the new sorts, you may be required to use very large input sizes. You should seperate the O(n²) sorts from the O(n lg(n)) sorts.

You should submit your code via email to danbennett360@gmail.com on the due date. Submit your report in class.