The object of this assignment is twofold. First, you are to compare the relative performance of different sorting algorithms on the same data set. Second, you are to compare the relative performance of the same algorithm on two different data sets. Six sorting algorithms are to be tested. Selection sort Bubble sort Insertion sort Merge sort Quick sort heap sort you must modify each sort to include a counter to keep track of the number of comparisons made.
## Deliverables
two files of integers to be sorted. There are a maximum of 100 integers in the first data set and a maximum of 1000 integers in second data se. Generate these data sets using a random-number generator.