Merge Sort and Insertion Sort Programs

In C++

Implement merge sort and insertion sort to sort an array/vector of integers. 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:

3 18 1 5 12

8 3 3 5 4 6 6 2 2

The output will be written to files called merge.out and insert.out. For the above example the output would be:

1 3 5 12 18

2 2 3 3 4 5 6 6 8