I've always found algorithms easier to understand once I can see them move. Pseudocode and textbook diagrams are fine, but for a lot of things — how a sort actually rearranges elements, why Dijkstra picks the path it does — a static picture only gets me so far. I usually end up tracing through it by hand on paper.
So I made a small thing to do that tracing for me: bigoh.dev. It's free, open, and meant for learning. Sharing it here in case it's useful to anyone else who thinks the same way.
What it does
You pick an algorithm or data structure, edit the input, and press play. It runs step by step on a canvas. Below the animation there's a short description of what's happening at the current step, and the pseudocode with the active line highlighted. You can step forward and back, or scrub a timeline to jump around. That's basically it.
A few of the visualizations are interactive in a way that helps: on graphs you click to add nodes and edges, on grids you click to toggle walls, and on the geometry plane you click to drop points. Then you watch the algorithm run on the thing you just drew.
