What is the worst-case time complexity of QuickSort?

QuickSort, on average, operates with a time complexity of O(n log n). However, in the worst case scenario, QuickSort can degrade to O(n^2). This happens when the pivot element is consistently chosen as the smallest or largest element, leading to highly unbalanced partitions. For instance, if the array is already sorted or reversely sorted, and the pivot is chosen as the first or last element, the partitioning step leads to one sub-array containing all the elements and the other being empty, resulting in O(n^2) behavior. Why Other Options Are Wrong : B) is the average-case time complexity of QuickSort, not the worst-case. C) and D) represent the time complexities of logarithmic and linear algorithms, respectively, but they are not relevant to QuickSort. E) O(n^3) is far worse than the actual worst-case time complexity of QuickSort.