algorithms
What an algorithm is
taught
Taught in
-
What an algorithm is
Discrete Mathematics I — Logic, Proof, and Structure
Requires
Nothing — this is foundational.
Required by
- Counting operations required
- Reading and writing pseudocode 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.