mplement a basic quick sort algorithm;

$2.$ Implement three pivot selection strategies:

a$.$ Rightmost selection $($always choose the rightmost element as

the pivot$)$

b$.$ Randomized selection $($randomly select a pivot$)$

c$.$ Estimated median selection $($randomly select three elements and

use their median as the pivot$)$

$3.$ Test each algorithm on the synthetic data and record the running time;

$4.$ Visualize the running time by plotting figure$($s$)$ where y$-$axis is time

and x$-$axis is data size;

$5.$ Write down a brief report to describe your implementation details and

show the figures.