The animation cannot lie
Each lesson is a small program that genuinely runs the mechanism and records every state. The picture is drawn from those states, so the numbers on screen are the real ones, and every lesson ships with tests proving it.
Interactive computer science · Free · No account
You can define recursion and still not picture what the machine is doing. That gap is not a gap in you. It is what a still diagram leaves out.
So here it is moving. Step through it with your own numbers.
8 minutes · Works on your phone · Nothing to install
Recursion · fib(4)
step 1/24
1 frame
We start with fib(4). Nothing has been worked out yet. It is a question waiting for an answer.
Four things happen in every lesson, in this order. None of them involve watching passively.
The lesson starts moving the moment it loads. Nothing to read first, nothing to press.
Scrub to any step, go backwards, slow it down. The picture is drawn from the state at that exact moment, so stepping back is real, not a rewind.
Three questions in every lesson, waiting where you came to be asked rather than interrupting the animation. You commit before you see the answer.
Set your own input and the whole simulation re-runs. It is your example now, not ours.
Each lesson is a small program that genuinely runs the mechanism and records every state. The picture is drawn from those states, so the numbers on screen are the real ones, and every lesson ships with tests proving it.
Intuition you cannot connect back to the standard material is entertainment. Every lesson names the concept the way the textbooks do, and shows the conventional notation beside the animation.
Read the intuition in ninety seconds, or open the mechanism, or go down to the hardware detail and real numbers. Same page, one toggle, so it is still worth opening on the second visit.
Named after the modules a computer science degree actually teaches, and anchored to the textbooks those courses are built from, so this works whether you are taking one, catching up on one, or filling a gap you never covered.
Algorithms
Recursion, the cost of a loop, and the two walls of the degree: searching, sorting and dynamic programming, each one running so you can take it apart.
Data Structures
How data is actually arranged in memory, and what each arrangement costs you, from a single pointer to a balanced tree, shown as the machine sees it.
OS
Deadlock as a graph you can watch lock up, paging as an address being quietly rewritten, and scheduling as a timeline you control.
Architecture
Pipelines stalling on a hazard, a cache deciding where a line goes, and what a float actually looks like in memory.
Recursion, with the call tree and the call stack side by side. Eight minutes, and you can change the numbers.
Open the lessonQuestions first? Read the FAQ.