# Sort Visualizer

> A free, interactive sort visualizer. Watch bubble, insertion, selection, merge, quick and heap sort run step by step, compare their speed, and understand Big-O — no signup, runs in your browser.

## Pages

- [Bubble Sort Visualizer](https://sort-visualizer.zerethon.com/bubble-sort-visualizer): Repeatedly swaps adjacent out-of-order pairs until the list is sorted. O(n²) — the classic first algorithm to learn.
- [Insertion Sort Visualizer](https://sort-visualizer.zerethon.com/insertion-sort-visualizer): Grows a sorted prefix one element at a time. O(n²) worst case, but near O(n) on almost-sorted data.
- [Selection Sort Visualizer](https://sort-visualizer.zerethon.com/selection-sort-visualizer): Repeatedly selects the smallest remaining element and places it next. O(n²), with the fewest swaps.
- [Merge Sort Visualizer](https://sort-visualizer.zerethon.com/merge-sort-visualizer): Divide and conquer: splits, sorts halves, and merges. Guaranteed O(n log n), stable, uses extra memory.
- [Quick Sort Visualizer](https://sort-visualizer.zerethon.com/quick-sort-visualizer): Partitions around a pivot and recurses. Usually the fastest in practice; O(n log n) average, O(n²) worst case.
- [Heap Sort Visualizer](https://sort-visualizer.zerethon.com/heap-sort-visualizer): Builds a binary heap and repeatedly extracts the max. O(n log n), in place, no extra memory.

## Related

- Sorting theory & Big-O (Learning hub): https://tools.zerethon.com/learn/sorting-algorithms