Homework 2 Sort Algorithms Solution

Description

Write a class that offers 2 functions that works exactly like the sorted() built-in function in python. Follow the following:

• 1. Function has 3 input parameters: iterable of objects, key, and reversed.

• 2. List can be numeric, string, or comparable user defined objects

• 3. The function returns a new sorted list

• 4. The function also returns:

     1. Number of comparisons

• 1. 2. Number of swaps

• 1. 3. Timer measure

• 5. Implement both bubble and merge sort as the 2 functions offered by your class.

• 6. Compare your functions on a randomly generated data

• 7. Compare your functions to the built-in sorted() function (time wise)

• 8. Present your findings thru plots and summary tables

• Document step-by-step how to use/run your code.