In C++
Sort an array of 10,000 elements using the quick sort algorithmas follows:
a. Sort the array using pivot as the middle element of thearray.
b. Sort the array using pivot as the median of the first, last,and
middle elements of the array.
c. Sort the array using pivot as the middle element of thearray. However,
when the size of any sublist reduces to less than 20, sort thesublist
using an insertion sort.
d. Sort the array using pivot as the median of the first, last,and
middle elements of the array. When the size of any sublistreduces to
less than 20, sort the sublist using an insertion sort.
e. Calculate
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured