Objectives - Apply Quick sort and Insertion sort algorithms Write a program to sort an array of random elements using quicksort as follows: 1. Sort the arrays using pivot as the first element of the array 2. Sort the arrays using pivot as the median of the first, last, and middle elements of the array 3. Sort the arrays using pivot as the first element of the array. However,, when the size of any sub-list reduces to less than 20, sort the sub-list using insertion sort. 4. Sort the array using pivot as the median of the first, last and middle elements of the array. When the size of any sub-list reduces to less than 20, sort the sub-list using insertion sort. 5. Calculate and display the CPU time for each of the preceding four steps. Example of the median of the first, last and middle elements: 123456780 (median of 1, 5, 0 is 1) 801234567 (median of 8, 3, 7 is 7) To calculate the CPU time, use the header , and clock_t type. You need to cast the duration to float and divide it by CLOCKS_PER_SEC. Depends on the CPU of your computer, your outputs would not be the same as in the sample output below. Sample Output: Enter array size: 100000 Quick sort time, with pivot as the first element: 0.039 Quick sort time, with pivot median element: 0.035 Quick sort and insertion sort time, with pivot as the first element: 0.034 Quick sort and insertion sort time, with pivot median element: 0.034 Would you like to enter another array size (y/n) y Enter array size: 300000 Quick sort time, with pivot as the first element: 0.111 Quick sort time, with pivot median element: 0.108 Quick sort and insertion sort time, with pivot as the first element: 0.107 Quick sort and insertion sort time, with pivot median element: 0.108

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.