CSC 344 - Algorithms and Complexity
Dr R. M. Siegfried
Assignment #3 - Analyzing the efficiency of sorts
Due Monday, February 20, 2017
We have seen working code for several sorts in class:
- selection sort
- insertion sort
- mergesort
- quicksort
|
- heap sort
- bubble sort
- cocktail shaker sort
|
We are going to generate three (3) sets of numbers:
- A random set of integers, generated using the random number generator
- The same set of number placed in ascending order.
- The same set of number placed in descending order.
Each of these sets will be run through each of the sorts, counting the number
of comparisons and the number of data movements (the swaps count as a single
data movement). Your program should also confirm that the values have been
sorted correctly
[Back to the Assignments Page]