Skip to content

Friday 11/10

Announcements

  • Project 3 (due Dec 05)
    • Part A due Tuesday, 11/28
    • Part B due Thursday, 11/30
    • Part C due Tuesday, 12/05
  • Chapter 12: Recursion
    • Also due Tuesday, 11/28

POGIL

Act12-Recursive.pdf

Model 1

factorial.py
1
2
3
4
5
6
7
8
9
def factorial(n):
    # base case
    if n == 0:
        return 1
    # general case
    product = 1
    for i in range(n, 0, -1):
        product *= i
    return product

Model 2

fibonacci.py
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
def fibonacci(n):
    # base case
    if n == 1 or n == 2:
        return 1
    # general case
    return fibonacci(n - 1) + fibonacci(n - 2)

if __name__ == "__main__":
    for i in range(1, 6):
        print(fibonacci(i))