How does the time complexity of the Quick Sort algorithm differ in the best, average, and worst cases?

The Quick Sort algorithm is a divide-and-conquer sorting method with varying performance based on the selection of pivot. In the best case, when the pivot divides the list into almost equal halves, the time complexity is O(n log n). The average case, which is also O(n log n), assumes a good but not perfect pivot selection. In the worst case, when the pivot results in one partition containing all the elements and the other being empty, the time complexity degrades to O(n^2).

For more details, refer to:

• Wikipedia: Quicksort
• GeeksforGeeks: Quick Sort