Quicksort Worst Case

When the array contains duplicate values When the pivot consistently produces highly unbalanced partitions, such as always picking the smallest or largest element When the array size is a prime number Quicksort is always O(n²); it never achieves O(n log n)