Write a C++ program that compares the execution times of Heap, Insertion Sort and Merge Sorts for inputs of different size. The time, in seconds, must be formatted with at least two decimal numbers. The implementation of Heap, Insertion and Merge Sorts are the same as we discussed in class. First, we must randomly generate inputs of different size, but the "same input" generated, must be applied to the three sorts. However, the random inputs must be copied to three different arrays, one for each sort, to make sure that they are not previously sorted by another sorting technique. The output of your program should look like: Input Length 1,000 10,000 25,000 50,000 150,000 250,000 Generated Random Input Heap Sort (seconds) XX.XX XX.XX XX.XX XX.XX XX.XX XX.XX Array 1 Array 2 Array 3 Insertion Sort (seconds) XX.XX XX.XX XX.XX XX.XX XX.XX XX.XX Merge Sort (seconds) XX.XX XX.XX XX.XX XX.XX XX.XX XX.XX Heap Insertion Merge Best time Heap Merge

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.