The optimal worst-case time complexity achievable by a comparison-based…
PYQ GATE 1990Modified — slightly modified from the official paper; see the solution
The optimal worst-case time complexity achievable by a comparison-based sorting algorithm is:
- A.
- B.
- C.
- D.
Attempted by 44 students.
Sign up free to check your answer
Sign up freeLoading lesson…

