What is the time complexity of quicksort algorithm?

The time complexity of the quicksort algorithm is O(n log n) in the average case and O(n2) in the worst case.