The tightest lower bound on the number of comparisons, in the worst case, for…
PYQ GATE 2004
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.
2
- C.
n log n
- D.
n log2 n
Attempted by 483 students.
Sign up free to check your answer
Sign up freeLoading lesson…