Algorithms
04 / Algorithms & optimization
The answer beneath the obvious one.
Graph, geometry, numerical, and combinatorial problems. Correctness first, then a careful examination of where the time and memory go.
The question underneath
Is the bottleneck the machine, or the idea?
State the invariant. Find the counterexample. Choose the simplest algorithm that satisfies the actual constraints.
Scope of practice
What the work
can include.
- 01Problem modeling and algorithm design
- 02Performance and memory optimization
- 03Correctness checks and comparative evaluation
Graphs / Search / Geometry / Numerical methods
Discuss your constraintsA closer look