algorithms
Big-O
taught
Taught in
-
Big-O
Discrete Mathematics I — Logic, Proof, and Structure
-
Algorithm complexity, revisited
Graph Theory
-
Limits, sequences, and big-$O$ notation
Optimization
Requires
- growth-rates required
Required by
- Big-Omega required
- Proving a Big-O bound required
- The master theorem required
Local knowledge map
Local knowledge map
Click to expand
Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.