← GATE CSE 2004

Q29

MCQ1 mark, −0.25

The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of

(A)

$n$

(B)

$n^2$

(C)

$n \log n$

(D)

$n \log^2n$

Sign in to save attempts.

Loading…