Python: Implement pow(x, n)

Last update on July 09 2025 10:45:28 (UTC/GMT +8 hours)

7. Implement pow(x, n)

Write a Python class to implement pow(x, n).

Sample Solution:

Python Code:

class py_solution:
   def pow(self, x, n):
        if x==0 or x==1 or n==1:
            return x 

        if x==-1:
            if n%2 ==0:
                return 1
            else:
                return -1
        if n==0:
            return 1
        if n<0:
            return 1/self.pow(x,-n)
        val = self.pow(x,n//2)
        if n%2 ==0:
            return val*val
        return val*val*x

print(py_solution().pow(2, -3));
print(py_solution().pow(3, 5));
print(py_solution().pow(100, 0));

Sample Output:

0.125                                                                                                         
243                                                                                                           
1

Pictorial Presentation:

Flowchart:

For more Practice: Solve these Related Problems:

• Write a Python class that implements the pow(x, n) function recursively, handling both positive and negative exponents.
• Write a Python class that uses an iterative approach with exponentiation by squaring to calculate x raised to the power n.
• Write a Python class that implements a fast power algorithm for computing powers in logarithmic time.
• Write a Python class that compares the performance of recursive versus iterative methods for calculating exponentiation.

Go to:

• Python Class Exercises Home ↩
• Python Exercises Home ↩

Previous: Write a Python class to find the three elements that sum to zero from a set (array) of n real numbers.
Next: Write a Python class to reverse a string word by word.

Python Code Editor:

Contribute your code and comments through Disqus.