Question

1. Write code for selection sort, insertion sort and bubble sort. Make sure that you are able to read input from a file that has an integer on every line.

2. Using your performance of selection, bubble and insertion sort, add a counter in an appropriate place so as to measure the runtime of your code for example this capacity be a counter to track number of compare operations, or move or shift operations in the innermost loop.

3. PLOT runtime as measured by the counter inserted in (2) for each of the three implementations selection, bubble and insertion sort for data set provided. Discuss your results. (Dus-2.txt has 2^2 elements; dus-10.txt has 2^10 elements, so on)

4. Take sorted output from 3, and use that as the "sorted input" for your three implementations. Do runtimes changes? Explain in details.