VisuAlgo
Animated visualisations of data structures and algorithms that you step through with your own input, covering sorting, trees, graphs, heaps and more. For anything you can follow in code but cannot picture.
Tool
Interview Prep
National University of Singapore
Minutes per concept
Beginner
Free
What it is
An interactive visualisation tool from the National University of Singapore, covering sorting, linked lists, binary search trees, heaps, hash tables, graph traversal, shortest paths, minimum spanning trees and more, each animated step by step on input you supply.
Why watching beats reading here
Some structures resist explanation in prose. A red black tree rebalancing, or a heap sifting an element down, is a sequence of small movements, and reading pseudocode for it is far harder than watching it happen once. Being able to run it on your own input is what turns a vague picture into a reliable one.
How to use it
When a structure will not click, come here, step through it slowly with a small input, and predict each next move before pressing the button. Being wrong is where the learning happens.
Best for: anyone learning data structures, and visual learners preparing for interviews.
Ready to start?
Opens on National University of Singapore in a new tab.
Stuck on something specific?
Writing only gets you so far. If you want an answer to your situation rather than the general case, book a session and we will work through it together. Every session is free; a few slots open each week.
Follow along
New writing, resources and project ideas land here first.