In this lesson you will learn about the basics of programming in python with recursion.
Prerequisites
- Python Basics (Expressions, Operators, and Precedence)
- Python Control Flow (Conditionals, Loops)
- Python Functions
| Setup | Download files required for the lesson | |
| 00:00 | 1. Introduction | Why do we bother learning about recursion? |
| 00:05 | 2. Factorial Function | What is a recursive function definition? |
| 00:20 | 3. Greatest Common Divisor | How can recursion be used to find the greatest common divisor of two positive integers? |
| 00:50 | 4. Fibonacci Sequence | How recursion can be used to find each term in the Fibonacci sequence? |
| 01:15 | 5. Constructing a Recursive Solution | How does a recursive solution gets constructed and executed? |
| 01:35 | 6. Towers of Hanoi | How recursive thinking can help us to solve Towers of Hanoi? |
| 02:35 | 7. Conclusion | What did we learn in this lesson? |
| 03:00 | Finish |
The schedule is simply a suggestion for you to budget your time.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
The site was built using Jekyll. The template was adopted (and modified) from Software Carpentry.