A
LESS PASSIVE READING. MORE “OH, I GET IT.”
Don't just explain it.
Let me change it.
Two algorithms. The same starting point. Change the rules, follow each step, and discover why the outcome changes.
THE LEARNING LOOPPredict.
Experiment.
Explain.Real algorithms. Reproducible inputs.
No AI API needed to run the labs.
Experiment.
Explain.Real algorithms. Reproducible inputs.
No AI API needed to run the labs.
EXPERIMENT 01 / SORTING
Same values. Different decisions.
MAKE A PREDICTIONWhich algorithm will need fewer comparisons? Try a nearly sorted input.
B
Insertion sort
READYStep 0
WHAT SHOULD YOU NOTICE?
The input changes the story.
Insertion sort works through a growing sorted prefix. Bubble sort compares neighboring values. Nearly sorted input often changes their comparison counts dramatically. The counters come from these runs, not from animation timing.
BUILT FOR YOUR NEXT “HOW DOES THIS WORK?”
Bring a concept.
Build another lab.
The included agent skill guides a coding agent from a concept to a working simulation, with a stated model, adjustable controls and checks for the things that must stay true.
TRY THIS WITH YOUR CODING AGENT
Use the explain-lab skill to build an interactive lab about cache replacement. Compare LRU and FIFO on the same request stream. Include a prediction, a stepper, and deterministic checks.Installation & examples ↗