How sorting animation helps
Each bar represents one array value. When an algorithm compares two positions, writes a value, swaps a pair, chooses a pivot, or merges a range, the visualiser records that operation as a step. The stage then replays those steps so you can connect the code idea to movement on screen.
Bubble, selection, and insertion sort make many local comparisons on random data. Merge sort writes values back while combining sorted ranges. Quick sort partitions around a pivot, while randomized quick sort changes the pivot choice before partitioning. Radix sort groups positive integer values by digit rather than comparing every pair directly.