Quicksort selects a pivot and partitions smaller values to its left and larger values to its right. It repeats the same operation on each partition.
Balanced partitions give average O(n log n) time, while consistently poor pivots can degrade to O(n²). The demo shows the partition boundary forming.
When to use
Use it to understand in-place partition based sorting.