The answer depends on strategy for choosing pivot. In early versions of Quick Sort where leftmost (or rightmost) element is chosen as pivot, the worst occurs in following cases.
1) Array is already sorted in same order.
2) Array is already sorted in reverse order.
3) All elements are same (special case of case 1 and 2)
Since these cases are very common use cases, the problem was easily solved by choosing either a random index for the pivot, choosing the middle index of the partition or (especially for longer partitions) choosing the median of the first, middle and last element of the partition for the pivot. With these modifications, the worst case of Quick sort has less chances to occur, but worst case can still occur if the input array is such that the maximum (or minimum) element is always chosen as pivot.
- Can QuickSort be implemented in O(nLogn) worst case time complexity?
- QuickSort Tail Call Optimization (Reducing worst case space to Log n )
- Find a permutation that causes worst case of Merge Sort
- Why quicksort is better than mergesort ?
- Stable QuickSort
- C++ Program for QuickSort
- Java Program for QuickSort
- Dual pivot Quicksort
- QuickSort using Random Pivoting
- Python Program for QuickSort
- Generic Implementation of QuickSort Algorithm in C
- QuickSort on Doubly Linked List
- 3-Way QuickSort (Dutch National Flag)
- QuickSort on Singly Linked List