Coding · Grade 9
Algorithms and Problem Decomposition
High-school learners define algorithms precisely (finite, definite, effective, with input and output) and test procedures against that definition, including the unsolved Collatz problem as a case where testing is not proof. They represent algorithms as flowcharts and pseudocode, trace classic algorithms such as Euclid's GCD with trace tables, and decompose problems while comparing algorithms for correctness and efficiency.
- 4 lessons
- About 85 min
- Quiz: 8 questions