Multiple choice

Quick sort's average time complexity is

  1. O(n2)

  2. O(nlogn)

  3. O(logn)

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

Quick sort's average performance is O(n log n) because the partitioning process effectively divides the array into roughly equal halves on average.

Keep practicing — related questions