Problem
Write a program to display the running time of Selection Sort and Merge Sort.
- Search and download a C++ code of Selection Sort and Merge Sort from an online source.
- Modify and test these sorts on arrays of various sizes. Arrays of the same size should contain identical entries to test each sort solution.
- Use the function clock from to calculate the run time of each of the two sorts.
- Include best / worst cases for each sort. (randomized data is preferable to test a big number of items)
- Display a table of the overall run time, along with the number of comparisons and the number of swaps of each sort solution for an array of size n.