Some comments regarding the complexity class

Quicksort is a well-known sorting algorithm that, on average, makes O(nlogn) 
comparisons to sort n items. However, in the worst case, it makes O(n2) comparisons.