python递归查找_Python程序使用递归查找数字的幂
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 yth 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 xelse:return pow(x, y-1) * x# main code if __name__ == '__main__':x = 2 #basey = 3 #powerresult = pow(x, y)print(x," to the power ", y, " is: ", result)x = 10 #basey = 3 #powerresult = pow(x, y)print(x," to the power ", y, " is: ", result)x = 12 #basey = 5 #powerresult = 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遞歸查找
創作挑戰賽新人創作獎勵來咯,堅持創作打卡瓜分現金大獎總結
以上是生活随笔為你收集整理的python递归查找_Python程序使用递归查找数字的幂的全部內容,希望文章能夠幫你解決所遇到的問題。
- 上一篇: 生产领料、退料频繁_领料号码
- 下一篇: Python | Tkinter中的文本