Sorting Algorithm Visualizer

Picks a pivot with median-of-three, partitions everything around it, then recurses into both sides. The median-of-three choice is what keeps sorted input off the quadratic path.

Watch for: The pivot locking into its final position and never moving again.

Pick up to four and run them on this exact array, side by side. They finish at different moments because the winner is decided by array accesses, not by frames.

the classic — height is value