Multiple choice

Quick 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

Quick sort's worst-case complexity is O(n^2), which occurs when the pivot selection consistently results in highly unbalanced partitions.

Keep practicing — related questions