PythonAdvanced

Recursion

Recursion in Python: solve problems by calling a function within itself, with factorial, Fibonacci, list sums, and power examples.

01Factorial

main.py

def factorial(n):
    if n <= 1:
        return 1
    return n * factorial(n - 1)

print(factorial(5))

Output

main.py

def fib(n):
    if n <= 1:
        return n
    return fib(n - 1) + fib(n - 2)

print([fib(i) for i in range(8)])

Output

[0, 1, 1, 2, 3, 5, 8, 13]

main.py

def sum_list(items):
    if not items:
        return 0
    return items[0] + sum_list(items[1:])

print(sum_list([1, 2, 3, 4, 5]))

Output

main.py

def power(base, exp):
    if exp == 0:
        return 1
    return base * power(base, exp - 1)

print(power(2, 8))

Output