Multiple choice technology programming languages

Complexity of Quick Sort????(avg)

  1. O(n2)

  2. O(log n)

  3. O(nlogn)

  4. O(n2 logn)
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

The average-case time complexity of Quick Sort is O(n log n), which occurs when the pivot consistently divides the array into reasonably balanced partitions. Distractors like O(n^2) represent the worst-case complexity, while O(log n) is too low and O(n^2 log n) is inefficient.

Keep practicing — related questions