Q. 12 Which one of the following is the recurrence equation for the worst case time
complexity of the Quicksort algorithm for sorting n^$ 2h numbers ? In the
recurrence equations given in the options below, c is a constant.
(A) T(n) = 2T (n/2) + cn
(B) T(n) = T(n – 1) + T(0) + cn
(C) T(n) = 2T (n – 2) + cn
(D) T(n) = T(n/2) + cn
Answer: (B)
Explanation:
