Recursion

Recursion

A recursive function calls itself. Every recursive function needs a base case to stop the recursion.

Factorial

The classic example — n! = n × (n−1)!

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

print(factorial(5))

Fibonacci Sequence

Each number is the sum of the two preceding ones.

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

for i in range(10):
    print(fibonacci(i), end=" ")