Q. 3 The tightest lower bound on the number of comparisons, in the worst case, for
comparision-based sorting is of the order of
(A) n
(B) n2
(C) n log n
(D) n log2 n
Answer: (C)
Explanation:
Q. 3 The tightest lower bound on the number of comparisons, in the worst case, for
comparision-based sorting is of the order of
(A) n
(B) n2
(C) n log n
(D) n log2 n
Answer: (C)
Explanation:
