Which one of the following is the tightest upper bound that represents the…

PYQ GATE 2013

Which one of the following is the tightest upper bound that represents the number of swaps required to sort nn numbers using selection sort?

  1. A.

    O(log n)O(log \ n)

  2. B.

    O(n)O(n)

  3. C.

    O(n log n)O(n \ log \ n)

  4. D.

    O(n2)O(n^2)

Attempted by 1517 students.

Sign up free to check your answer

Sign up free

Explore the full course: Algorithms

Loading lesson…