Question: when quicksort in worst case?
Answer: Slow Worst-Case. In the worst case, quicksort can take O ( n 2 ) O(n^2) O(n2) time. While this isn't common, it makes quicksort undesirable in cases where any slow performance is unacceptable.