python递归查找

Given the base x and the power y and we have to find the x to the power y using recursion in Python.

给定基数x和幂y ，我们必须使用Python中的递归找到x到幂y 。

By using recursion – We will be multiplying a number (initially with value 1) by the number input by the user (of which we have to find the value of y^th power) for y times. For multiplying it by y times, we need to call our function y times. Since we know the number of times function will execute, so we are using for recursion. 

通过使用递归–我们将一个数字(最初是值1)乘以用户输入的数字(必须找到y ^次方的值) y次。 为了将它乘以y倍，我们需要调用函数y倍。 由于我们知道函数执行的次数，因此我们将其用于递归。

Python code to find the power of a number using recursion

Python代码使用递归找到数字的幂

# Python code to find the power of a number using recursion 
# defining the function to find the power
# function accpets base (x) and the power (y)
# and, return x to the power y
def pow(x, y):
if y == 1:
return x
else:
return pow(x, y-1) * x
# main code
if __name__ == '__main__':
x = 2 #base
y = 3  #power
result = pow(x, y)
print(x," to the power ", y, " is: ", result)
x = 10 #base
y = 3  #power
result = pow(x, y)
print(x," to the power ", y, " is: ", result)
x = 12 #base
y = 5  #power
result = pow(x, y)
print(x," to the power ", y, " is: ", result)

Output

输出量

2  to the power  3  is:  8
10  to the power  3  is:  1000
12  to the power  5  is:  248832

翻译自: https://www.includehelp.com/python/find-the-power-of-a-number-using-recursion.aspx

python递归查找