Quicksort Implementation: In-Place Partitioning

The "clever" implementation of Quicksort uses two pointers, one coming in from the left, and the other coming in from the right. This website describes how the system works.