The reading gives you the why; this gives you the how. Twenty-four algorithms — dynamic-programming tables filling cell by cell, graphs exploring, the Sieve of Eratosthenes crossing out composites, Dijkstra settling the nearest node, RSA round-tripping a number through modular exponentiation — each stepped across six panels: the variables, the arithmetic, the source line, memory (the stack, the heap, the table, the queue), and every step narrated in plain words and under the hood.
How to use it: press Next (or the → key) and predict the next beat before you look — predict, step, check. Part A steps through the core techniques (divide & conquer, sliding windows, greedy, DP, backtracking); Part B steps through the named algorithms in action (sorting that beats n log n, graph search, string matching, number theory, and randomization). Every beat here was verified against a real run of the code in Python 3.12.
Predict → step → check — the whole method.