Question

if we use the select algorithm to find the medium and use the medium as the pivot for quicksort, we can make quicksort run in o(nlogn) in the worst-case scenario. prove this claim.