Simple code please thats easy to follow.

C++

Write a program that can be used to compare Insertion Sort, Merge Sort and Quick Sort.

Program must:

• Read an array size from the user, dynamically an array of that size, and fill the array with random numbers
• Sort the array with the Insertion Sort, MergeSort and QuickSort algorithms studied in class, doing a time-stamp on each sort.

Use your program to measure and record the time needed to sort random arrays of size 5000, 50000, and 500000. For each array size, obtain a printout of the time required for the sorts.