What is the time complexity of Quick Sort in the worst case?

Question

Accepted Answer

(B) O(n²). Explanation: Worst case for Quick Sort occurs when the pivot is always the smallest or largest element, leading to O(n²) comparisons.