Python实现斐波那契递归和尾递归计算
发布时间:2020-12-20 10:23:51 所属栏目:Python 来源:网络整理
导读:# #斐波那契递归测试 def fibonacciRecursive(deepth): if deepth == 1 : return 1 elif deepth == 2 : return 1 else : return fibonacciRecursive(deepth - 1) + fibonacciRecursive(deepth - 2 ) # #斐波那契尾递归测试 def fibonacciTailRecursive(num,r
##斐波那契递归测试 def fibonacciRecursive(deepth): if deepth == 1: return 1 elif deepth == 2: return 1 else: return fibonacciRecursive(deepth - 1) + fibonacciRecursive(deepth - 2) ##斐波那契尾递归测试 def fibonacciTailRecursive(num,ret1,rte2): if num == 1: return rte2 return fibonacciTailRecursive(num-1,rte2,ret1+rte2) if __name__ == "__main__": a = fibonacciRecursive(30) print(a) a = fibonacciTailRecursive(30,1) print(a) (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |