C++

Programming: Programmatically generate three type o Programming: f arrays (or vectors) of size 10,000: an array that is sorted in ascending order, a reversed array (an array that is sorted in descending order), and a random array.

Programmatically sort the three arrays using bubble sort, selection sort, insertion sort, shell sort, merge sort, and quick sort (the regular one and the improved one ) algorithms. For each sorting algorithm, calculate the number of exchanges (or shifts) and the number of comparisons for these sorting algorithms. Summarize the result in tables (see below).

Discuss whether your results match the big O of these algorithms

Please submit the source code (.cpp fil Submission: es) as well as tables that summarize the results