Next
1. Print 1 to N Recursively2. Factorial Using Recursion3. Print N to 1 Recursively4. Even Numbers 1-N Recursively5. Odd Numbers 1-N Recursively6. Sum of First N Natural Numbers Recursively7. Power x^n Recursively8. Nth Fibonacci Recursively9. Fibonacci Series Recursively10. Sum of Digits Recursively

Power x^n Recursively

Calculate x raised to power n recursively.

IntermediatePhase 3 - Level 1: Basic RecursionExample 7 of 10
power-x-n-recursively.py
1def power(x, n):
2    # Base case
3    if n == 0:
4        return 1
5    if n == 1:
6        return x
7    
8    # Recursive case
9    return x * power(x, n - 1)
10

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

Output

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

What's going on

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

🔗Related Content

PreviousSum of First N Natural Numbers RecursivelyNextNth Fibonacci Recursively