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

Nth Fibonacci Recursively

Find nth Fibonacci number recursively.

Logic BuildingIntermediate

Logic Building

def fibonacci(n):
    # Base cases
    if n == 0:
        return 0
    if n == 1:
        return 1
    
    # Recursive case
    return fibonacci(n - 1) + fibonacci(n - 2)

# Test
n = int(input("Enter n: "))
result = fibonacci(n)
print(f"Fibonacci({n}) = {result}")

Output

Enter n: 7
Fibonacci(7) = 13

Fibonacci(n) = Fibonacci(n-1) + Fibonacci(n-2).

Key Concepts:

Base cases: F(0) = 0, F(1) = 1
Recursive: sum of previous two
Each term depends on two previous

Power x^n Recursively

Fibonacci Series Recursively