0

Choose one O(n log n) and one O(n2) sorting algorithm. Choose a third algorithm of any time complexity. For each of the three algorithms you have chosen, implement the algorithm.

Then, write a short piece of code that will generate the following:

1. A file of 1000 random integers

2. A file of 10000 random integers

3. A file of 100000 random integers

Run your three sorting routines and, using C++ library functions, time the execution of each of the three routines on the three data sets. Graph the results. Then, write a brief analysis and summary of the results.