Multiple choice

Quick sort's worstcase 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 occurs when pivots consistently create maximally unbalanced partitions (sorted or reverse-sorted input with poor pivot choice), degrading to O(n²) time complexity.

Keep practicing — related questions