topic 03
Know one programming language, know no algorithms. Finish able to solve hard problems with confidence.
How to measure an algorithm's cost before you ever run it.
The array: a row of boxes, and the patterns that sweep across it.
Order unlocks speed: sort once, then find in logarithmic time.
A function that calls itself, and how to explore every option.
Trade memory for time: answer 'have I seen this?' instantly.
Three ways to hold a sequence, each with its own discipline.
Data that branches, and recursion as the natural way to walk it.
Always reach the smallest (or largest) item first.
Nodes and edges — how to explore, order, and find shortest paths.
Solve once, remember, reuse — turning exponential into polynomial.
Take the best local choice — and prove it stays best.
Bits, intervals, and reading a problem to pick the right tool.
Every unit, from the underground to the orbit. Algorithms from zero is one constellation in the atlas — climb another topic and watch the next one light up.