The behavior of quick sort is ____ in the worst case and ____ in the average case. A) O(nlog₂n), O(nlog₂n) B) O(n²), O(n) C) O(nlog₂n), O(n²) D) O(n²), O(nlog₂n)

Question

Quizplus · Accepted Answer

In the worst case, quick sort has a time complexity of O(n^2) when the pivot selection leads to unbalanced partitions. In the average case, it has a time complexity of O(nlogn) due to balanced partitions.

The Behavior of Quick Sort Is ____ in the Worst