Logic Building/Phase 3 - Level 1: Basic Recursion/Program

Fibonacci Series Recursively

Print Fibonacci series up to n terms recursively.

Logic BuildingIntermediate

Logic Building

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

# Print series
n = int(input("Enter number of terms: "))
for i in range(n):
    print(fibonacci(i), end=" ")
print()

Output

Enter number of terms: 8
0 1 1 2 3 5 8 13

Call fibonacci function for each index.

Key Concepts:

Loop from 0 to n-1
Call fibonacci(i) for each
Print each term

Nth Fibonacci Recursively

Sum of Digits Recursively