Three views: bars · algorithm in motion · pseudocode
The Problem: Sort N unsorted numbers efficiently. Each algorithm has a unique strategy — use the Algorithm View to see its internal structure animated (call tree for Merge/Quick, heap for Heap Sort, pass grid for Bubble/Selection, insertion rail for Insertion Sort), and the Code View to follow the highlighted pseudocode line by line.
18 elements
Medium
📊 Bar View
🔬 Algorithm View
💻 Code View
Comparisons: 0
Swaps/Writes: 0
Array Size: 18
Press an algorithm to begin!
Comparing
Swapping
Min Selected
Pivot
Sorted
Choose an Algorithm
Select an algorithm above. Use the three view tabs to switch between bar visualization, algorithm structure in motion, and live pseudocode.