Sorting Algorithm Visualizer

Sorting is the classic visualization subject for a good reason: the entire algorithm is visible in the movement of the data. The difference between an O(n²) and an O(n log n) sort is not a fact to be recalled, it is something you can watch happen on the same input.

This topic covers the comparison sorts and the non-comparison sorts, which is the distinction interviewers probe when they ask whether you can do better than n log n. Stepping through counting and radix sort makes the answer concrete — they are faster because they never compare two elements at all.