Quicksort
Given a list of elements,
- take a partitioning element
- and create a (sub)list
- such that all elements to the left of the partitioning element are less than it,
- and all elements to the right of it are greater than it.
- Now repeat this partitioning effort on each of these two sublist