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 n-1 passes with decreasing comparisons per pass, totaling approximately n²/2 comparisons regardless of input order, giving O(n²) in all cases.

Keep practicing — related questions