Module: Decomposition & Recursion
Overview
Decomposing problems into subproblems and assembling an algorithmic solution from the solutions of the subproblems is an essential task for computer scientists. This teaching module explains decomposition and the idea of recursion that is decomposition applied repeatedly. Specifically, it covers the following questions and topics.
- Decomposition of algorithms
- The general nature of recursion
- Components of recursive descriptions
Prerequisites
Contained in this Module
Decomposing Algorithms
Algorithms can be decomposed into smaller parts.
60 minutes
Individual or Group