Sort an array of 10,000 elements using the quick sort algorithm as follows: Sort the array using pivot as the middle element of the array. a. Sort the array using pivot as the median of the first, last, and middle elements of the array. b. Sort the array using pivot as the middle element of the array. How- ever, when the size of any sublist reduces to less than 20, sort the sublist using an insertion sort. c. Sort the array using pivot as the median of the first, last, and middle elements of the array. When the size of any sublist reduces to less than 20, sort the sublist using an insertion sort. d.

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.