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:

  1. A.

    Θ(nlog⁡n)\Theta (n \log n)

  2. B.

    Θ(n)\Theta (n)

  3. C.

    Θ(n2)\Theta \left(n^2\right)

  4. D.

    Θ(nn)\Theta (n\sqrt n)

Attempted by 44 students.

Sign up free to check your answer

Sign up free

Explore the full course: Algorithms

Loading lesson…