Choose a pivot, partition around it (smaller left, larger right), recurse on both sides. The most widely used sorting algorithm in practice.
Average: O(n log n)
Worst: O(n²) (bad pivots)
Space: O(log n) stack
Stable: No
Magenta = pivot. Regions colored by recursion depth. Watch partitioning in action.