python 斐波拉契递归 尾递归 备忘录 动态规划 迭代

1 递归

#coding=utf-8
'''

@author: 182
'''
from time import time
def fab(n):
    if n==0:
       return 0
    if n==1:
       return 1
    if (n!=0 and n!=1):
       return fab(n-1)+fab(n-2)
    
def main():
    start = time()
    print fab(100)  
    stop = time()
    
    print(str(stop-start) + "秒")
     
if __name__ == '__main__':
    main()

2 尾递归

#coding=utf-8

'''

@author: 182
'''

from time import time

def weidigui(n,w1,w2):
    if n<2:
        return w1
    else:
        return weidigui(n-1,w2,w1+w2)
    
def main(): 
    
    start = time()
    print weidigui(99,1,1)  
    stop = time()
    print(str(stop-start) + "秒")
if __name__ ==