Data structures & algorithms,
brought to life.
Turn any 2D array into a colorful grid, watch sorting run step by step, and count the steps algorithms take. No setup, no sign-up.
Visualizers · a good order to explore them
Roadmap →Big-O Playground→
Never heard of Big-O? Start here: a tiny story, count steps with the computer, then watch real growth curves. No math degree required.
1D Array Visualizer→
Read a slot in one step, shift values to insert or delete, search box by box and reverse with two pointers, with every read and write counted.
Sorting Visualizer→
Compare Bubble, Selection & Insertion sort, then watch each one run a step at a time — animated bars, synced pseudocode, and live comparison/swap counters.
2D Array Visualizer→
Paste any 2D array or matrix and see it as a grid. Color cells by value, show row and column indices, and learn how rows and columns map to memory.
Grid Traversals→
Six ways to walk a grid, one step at a time: row-major, column-major, snake, diagonal, boundary and spiral, with live indices and a visit number on every cell.
Matrix Operations→
Transpose, rotate, flip and multiply a matrix one cell at a time: the source and the result side by side, with live indices, counters and code in four languages.
Grid Algorithms→
BFS and DFS on a 2D array, one step at a time: flood fill a region, count the islands, and find the shortest path through a maze. Click cells to change the grid.
Step-by-step
Play, pause, and scrub through every comparison and swap at your own pace.
Learn as you explore
Pseudocode, complexity, and C++/Python/JS/TS code sit right beside each visual.
Free & open source
No setup, no sign-up. MIT-licensed and runs entirely in your browser.