Perform a series of benchmarking tests on a version of merge-sort and quick-sort to determine which one is faster. Your tests should include sequences that are “random” as well as “almost” sorted.  ...

Perform a series of benchmarking tests on a version of merge-sort and

quick-sort to determine which one is faster. Your tests should include

sequences that are “random” as well as “almost” sorted.

Implement deterministic and randomized versions of the quick-sort algorithm

and perform a series of benchmarking tests to see which one is

faster. Your tests should include sequences that are very “random” looking

as well as ones that are “almost” sorted.