Watch how different algorithms sort the same list. The bar colour tells you what the algorithm is doing right now.
Bubble Sort — compares neighbours and swaps them. O(n²) worst case. Easy to understand but slow.
Draw walls with your mouse. Click "Find path" — watch how A*, Dijkstra, or BFS explores the grid differently.
Tip: start is the teal cell, end is the gold cell. You can drag the start/end too.
Real measured runtimes at different input sizes. This is why O(n log n) beats O(n²) as the list grows.
Click "Race" to measure real times. Larger n = longer bars. Watch how the O(n²) bars explode.
Sieve of Eratosthenes, GCD (Euclid's algorithm), and Fibonacci with live visualisation.
Prerequisites between Math and other subjects. Hover a node to highlight its dependency chain. Click a node to see what unlocks after it.
Hover or click a topic to see the dependency chain.
Timed CAPS-aligned questions. Your best score is saved on this device.