In C++

: You will write a program that compares the execution time of several sorting algorithms, and displays the results as a table

You will be sorting arrays of 100000 integers

The integers must be randomly generated.

Each sorting algorithm will use the same array

The sorting algorithms to be used are:

o Selection

o Insertion

o Quick

o Modified Quicksort (size 30)

o Radix

You were not given the code for this algorithm, you must actually write it

o Heap

You were not given the code for this algorithm, you must actually write it

You may NOT use the heap in the STL

The comparisons should be done on 5 different arrays, and the average execution time should be displayed

Each algorithm will be called in a function, and each function definition will be template

Each function template will be in a separate header file

Internal documentation is required :