- #iterative implementation
- #complexity O(n)
- def fibo_it(i):
- a,b,cpt=0,1,0
- while cpt <= i:
- if cpt < 2 :
- c = cpt
- else :
- c=a+b
- a=b
- b=c
- cpt+=1
- return c
-
- #iterative implementation of generator
- def fibogen_it(i):
- a,b,cpt=0,1,0
- while cpt <= i:
- if cpt < 2 :
- c = cpt
- else :
- c=a+b
- a=b
- b=c
- cpt+=1
- yield c
-
- #simple recursive implementation
- #complexity O(2^n)
- def fibo_rec(i):
- if i < 2 :
- return i
- return fibo_rec(i-1)+fibo_rec(i-2)
-
- #recursive implementation of generator
- def fibogen_rec(i):
- for j in range(i) :
- yield fibo_rec(j)
#iterative implementation
#complexity O(n)
def fibo_it(i):
a,b,cpt=0,1,0
while cpt <= i:
if cpt < 2 :
c = cpt
else :
c=a+b
a=b
b=c
cpt+=1
return c
#iterative implementation of generator
def fibogen_it(i):
a,b,cpt=0,1,0
while cpt <= i:
if cpt < 2 :
c = cpt
else :
c=a+b
a=b
b=c
cpt+=1
yield c
#simple recursive implementation
#complexity O(2^n)
def fibo_rec(i):
if i < 2 :
return i
return fibo_rec(i-1)+fibo_rec(i-2)
#recursive implementation of generator
def fibogen_rec(i):
for j in range(i) :
yield fibo_rec(j)