Worst case – complexity

• In worst case, quick sort is only as good as the naive sorting algorithm, because each pair of elements has to be compared: