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

Power x^n Recursively

Calculate x raised to power n recursively.

Logic BuildingIntermediate

Logic Building

def power(x, n):
    # Base case
    if n == 0:
        return 1
    if n == 1:
        return x
    
    # Recursive case
    return x * power(x, n - 1)

# Test
x = int(input("Enter base: "))
n = int(input("Enter exponent: "))
result = power(x, n)
print(f"{x}^{n} = {result}")

Output

Enter base: 2
Enter exponent: 5
2^5 = 32

Power(x, n) = x * Power(x, n-1).

Key Concepts:

Base case: x^0 = 1, x^1 = x
Recursive: x * x^(n-1)
Multiply x with result of smaller power

Sum of First N Natural Numbers Recursively

Nth Fibonacci Recursively