Sorting Visualizers

6

Step through every Sorting problem with animated runtime state, source highlighting, and curated test cases. Built for coding-interview prep and durable algorithmic intuition.

Bucket Sort
Distribute n elements into n buckets by value range, sort each bucket, then concatenate.
Distribution Sort
Counting Sort
Count occurrences of each element, then reconstruct the sorted array from counts.
Non-Comparison Sort
Counting Sort - Stable - Code
Line-by-line walkthrough of stable counting sort with a live locals tracker.
Stable Counting Sort
Counting Sort - Stable - Logic
Why right-to-left placement with prefix-sum end-pointers preserves the original order of equal keys.
Stability via Prefix Sums
Quick Sort
Partition array around pivot, recursively sort left and right halves using divide and conquer.
Divide and Conquer
Radix Sort
Sort numbers digit by digit from least significant to most significant using stable counting sort.
Non-Comparison Sort (Digit-by-Digit)