Week 8 - Recursive Algorithms
Outcomes
You should be able to:
- Describe the three "laws" of recursion.
- Identify where each of the three "laws" of recursion are observed in a recursive algorithm.
- Identify the Big-oh runtime analysis for a recursive algorithm.
Reading
- Section 4.2 - What is Recursion?
- Section 4.3 - Calculating the Sum of a List of Numbers
- Section 4.4. The Three Laws of Recursion
- Section 4.5. Converting an Integer to a String in Any Base
- Section 4.6. Stack Frames: Implementing Recursion
- Section 4.7. Visualizing Recursion
- Section 4.8. Sierpinski Triangle
- You may read 4.10 and 4.11 based on your interests