The worst-case time complexity of Quick Sort is

Explanation

When the pivot is always the smallest or largest element (for example on an already sorted array with the first element as pivot), the partitions are unbalanced and the cost is O(n²).