Quick Sort is very efficient if CUTOFF is the median.

How do we find the median?

All the obvious methods require that we sort L! This is no good!

In practice, people use something that is easier to compute:

Worst case: always pick the smallest element as the CUTOFF.