1.

Which of the following is correct recurrence for worst case of QuickSort?

A. T(n) = T(n - 4) + T(n - 2) + O(1)
B. T(n) = T(n - 1) + T(0) + O(n)
C. T(n) = 2T(n/2) + O(n)
D. T(n) = 4T(n/2) + O(n)
Answer» C. T(n) = 2T(n/2) + O(n)


Discussion

No Comment Found