1.0060 Explain, in general terms, how a quick sort works.

A quick sort works by recursively partitioning a list into smaller sublists, each time making sure that the sublists to the left contain smaller elements than the list it was derived from, while the sublists to the right contain elements larger than the sublists to the right. The process continues until there is only one element left on the list.

The general pattern/example (albeit in need of additional explanation) is: