topic / programming-algorithms
Programming & Algorithms
Turn a problem into a precise procedure, then account for its cost.
Study the programming building blocks and algorithmic strategies behind searching, sorting, dynamic programming, graphs, and efficient problem solving.
4 articles · 4 videos · 4 traces · 2 request flows · 2 interviews · 16 total
Articles
Arrays and Memory: How Indexing Works
Why array indexing is O(1), how the CPU computes element addresses, and what spatial locality means for performance.
Recursion: Functions Calling Themselves
How a function can solve a problem by delegating a smaller version of the same problem to itself, the call stack, and common pitfalls.
What Is an Algorithm?
A precise, step-by-step procedure for solving a problem or completing a task, illustrated with pseudocode and real-world analogies.
Algorithms Are Procedures With Costs
Learn to connect an algorithm's correctness argument to the comparisons, branches, and memory accesses it performs.
Request Flows
Videos
Advanced Algorithms: Sorting, Graphs, and Dynamic Programming
Master sorting, graph traversal, and dynamic programming through execution traces that reveal the mechanics behind the algorithms.
DetailsLearning Algorithms from Scratch
A beginner-friendly walkthrough of what an algorithm is, how arrays store data in memory, and how simple search and insertion traces execute.
DetailsData Structures and Algorithms: From Arrays to Trees
Master arrays, hash tables, trees, and recursion through execution traces that show what actually happens in memory.
DetailsWhy Big-O Does Not Predict Every Run
A planned visual lesson connecting algorithmic growth to input shape, memory access, branches, and measured runtime.
DetailsTraces
Interviews
Explore adjacent
New lessons by email
Get new explanations about programming & algorithms and related systems in your inbox.
One technical dispatch per week. No noise.