Explorable lab notebook

Re-invent computer science visually.

Start from a concrete problem, test the naive idea, watch it fail, then build the smallest useful abstraction with interactive traces.

trace snapshot
queue = [B, C]
visited = {A, B, C}

try a naive approach

How it works

Begin with a small pressure point instead of a definition.

Make the first idea visible enough to see where it breaks.

Introduce one new tool that removes the pain.

Link the result to code, invariants, complexity, and the graph.

Featured concepts

Concepts

Draft

Adjust Rand-style pair agreement by subtracting the agreement expected from the cluster and class margins.

Draft

Keep sorted keys searchable with a shallow multiway tree whose nodes hold many keys at once.

Draft

Speed up point lookups and range scans by keeping guide keys above and all records in linked leaves.

Draft

Report all segment intersections by sweeping left to right and checking only local neighbors.

Graph

Concept nodes stay connected by prerequisites, contrasts, and uses, so each page has a visible place in the learning map.

Roadmap preview

Curated paths keep the first version focused while leaving space for algorithms, systems, theory, and data structures.