Quicksort works by first selecting a ‘pivot’ point, and partitioning the list around this pivot so that all elements smaller than the pivot are before it, and all elements larger are after. It then recursively repeats this process on the unsorted sublist before the pivot and the one after.