Nov 15: Recursive Functions
Learning Objectives
After today's class, you should be able to:
- Identify the base case and recursive step of the factorial function.
- Trace a recursive function by hand to predict the number of calls.
- Write short recursive functions based on mathematical sequences.
Announcements¶
- Project 3 (due Dec 03)
- Part A due Monday, 11/18
- Part B due Thursday, 11/21
- Part C due Tuesday, 12/03
- Chapter 12: Recursion
- Read by Tuesday, 11/19
POGIL Activity¶
- Recursive Functions
- If you are absent today, complete this activity at home
- Bring your completed activity to class or office hours
Model 1¶
factorial.py | |
---|---|
1 2 3 4 5 6 7 8 9 |
|
Model 2¶
fibonacci.py | |
---|---|
1 2 3 4 5 6 7 8 9 10 |
|