Sorting Visualizer

Sorting algorithms look identical in pseudocode until you see them move. The Sorting Visualizer animates Bubble, Selection, Insertion, Merge, Quick, and Heap sort across live data arrays — making comparison counts, swap patterns, and divide-and-conquer splits immediately intuitive.

Algorithm Quick Reference

• Bubble Sort: O(n²) — simple but slow. Useful for understanding swap mechanics.
• Merge Sort: O(n log n) — stable, divide-and-conquer. Excellent for linked lists.
• Quick Sort: O(n log n) avg — in-place, fast in practice. Pivot choice matters.
• Heap Sort: O(n log n) — in-place, not stable. Priority queue applications.