algorithms
Loop invariants
taught
Taught in
-
Loop invariants
Discrete Mathematics I — Logic, Proof, and Structure
Requires
- correctness-and-termination required
Required by
- Proving an algorithm correct 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.