Algorithms
A map for analyzing algorithms, recognizing design patterns, and choosing an appropriate problem-solving family.
A map for analyzing algorithms, recognizing design patterns, and choosing an appropriate problem-solving family.
Contiguous indexed storage, resizing, amortized append, and shifting costs.
Choose a starting point for algorithm costs, data structures, Python programming, and testing.
A compact map of the durable ideas that sit underneath programming languages, frameworks, and AI systems.
A representation-first map for choosing containers by operations, invariants, and memory behavior.
A foundation map for logic, proof, counting, discrete structures, and probability in computer science.
A comparison of contiguous sequences, linked nodes, stacks, and queues.
Node-linked sequences, local splicing, traversal costs, and ownership invariants.
A compact map of the maintained language notes on this site and how to choose what to learn next.
FIFO processing through deques, linked endpoints, and circular buffers.
The LIFO interface, implementation choices, and algorithmic invariants it expresses.