Q2

MCQ1 mark, −0.33

Which one of the following is the recurrence equation for the worst case time complexity of the quick sort algorithm for sorting $n\;( \geq 2)$ numbers? In the recurrence equations given in the options below, $c$ is a constant.

(A)

$T(n) = 2 T (n/2) + cn$

(B)

$T(n) = T ( n - 1) + T(1) + cn$

(C)

$T(n) = 2T ( n - 1) + cn$

(D)

$T(n) = T (n/2) + cn$

Loading…