Q. 7 Consider the Quicksort algorithm. Suppose there is a procedure for finding a
pivot element which splits the list into sub-lists each of which contains at least
one-fifth of the elements. Let T(n) be the number of comparisons required to sort
n elements. Then
Answer: (B)
Explanation:
