Question

Python

Challenge 2: there is a sorting algorithm called Quick Sort that used a recursive method. Learn how that works.

Q: write the power x to n function through recursive method. Assume n is positive.

A: Day09_57.py

Answer 1

Answer:

def power(x,n):

if(n==1):

return(x)

if(n!=1):

return (x*power(x,n-1))

x=int(input("Enter the value of x: "))

n=int(input("Enter the exponential value: "))

print("Recursive Result :",power(x,n))

Run result:

Enter the value of x: 5

Enter the exponential value: 4

Recursive Result : 625

Screenshot for reference:

In [4]: def power(x,n): if(n==1): return(x) if(n!-1): return (x*power(x,n-1)) x=int(input("Enter the value of x: ")) neint(input("Enter the exponential value: ")) print("Recursive Result :", power(x,n)) Enter the value of x 5 Enter the exponential value: 4 Recursive Result 625