Python Data Structures and Algorithms - Recursion: Calculate the value of 'a' to the power 'b'

Last update on March 27 2025 12:50:20 (UTC/GMT +8 hours)

10. Exponentiation Using Recursion

Write a Python program to calculate the value of 'a' to the power of 'b' using recursion.

Test Data:
(power(3,4) -> 81

Sample Solution:

Python Code:

# Define a function named power that calculates the result of 'a' raised to the power of 'b'
def power(a, b):
    # Check if 'b' is 0 (base case for power function)
    if b == 0:
        # If 'b' is 0, return 1 (any number raised to the power of 0 is 1)
        return 1
    # Check if 'a' is 0 (base case for power function)
    elif a == 0:
        # If 'a' is 0, return 0 (0 raised to any power is 0)
        return 0
    # Check if 'b' is 1 (base case for power function)
    elif b == 1:
        # If 'b' is 1, return 'a' (any number raised to the power of 1 is the number itself)
        return a
    else:
        # If none of the base cases is met, recursively call the power function
        # to calculate 'a' multiplied by the result of 'a' raised to the power of 'b-1'
        return a * power(a, b - 1)

# Print the result of calling the power function with the input values 3 and 4
print(power(3, 4))

Sample Output:

81

Flowchart:

For more Practice: Solve these Related Problems:

• Write a Python program to recursively calculate a^b using exponentiation by squaring for efficiency.
• Write a Python program to implement a recursive function that computes the power of a number without using the built-in operator.
• Write a Python program to compute a^b using tail recursion, optimizing for large exponents.
• Write a Python program to use a recursive divide-and-conquer approach to calculate exponentiation for two integers.

Python Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a Python program to calculate the geometric sum of n-1.
Next: Write a Python program to find the greatest common divisor (gcd) of two integers.