Multiple choice

Selection sort's worst-case time complexity is

  1. O(n2)

  2. O(nlogn)

  3. O(logn)

  4. O(n)
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Selection sort always performs a nested loop to find the minimum element, resulting in O(n^2) complexity regardless of the initial order of elements.

Keep practicing — related questions