0 1 1 2 3 5 8 13 21 34
cur next next_next
cur + next = next_next
iteration: (fast)
def fib(n):
cur, next = 0, 1
k = 0
while k< n:
next_next = cur + next
cur, next = next, next_next
k = k+1
return cur
recursion:
def fib(n):
if n==0:
return 0
elif n==1:
return 1
else:
return fib(n-1)+fib(n-2)