Part A:

Using C++. Implement merge sort and insertion sort programs to sort an array/vector of integers. You may implement the algorithms in C++ language, name one program mergesort and the other insertsort. Your programs should be able to read inputs from a file called data.txt where the first value of each line is the number of integers that need to be sorted, followed by the integers.

Example values for data.txt: 4 19 2 5 11

8 1 2 3 4 5 6 1 2

The output will be written to files called merge.out and insert.out. For the above example the output would be: 2 5 11 19 1 1 2 2 3 4 5 6

Part B:

The goal of this problem is to compare the experimental running times of the two sorting algorithms. a) Now that you have proven that your code runs correctly using the data.txt input file, you can modify the code to collect running time data. Instead of reading arrays from a file to sort, you will now generate arrays of size n containing random integer values from 0 to 10,000 and then time how long it takes to sort the arrays. We will not be executing the code that generates the running time data so it does not have to be submitted to TEACH or even execute on flip. Include a text copy of the modified code in the written HW submitted in Canvas.