ObjectiveMCQ
Print Protected
This page is protected for print. Use the website to view the content.
What is the worst-case time complexity of QuickSort?
Correct Answer: B — B: O(n²)
QuickSort has O(n²) worst-case when the pivot is always the smallest or largest element.