fibonacci using recursion codility python code example
Example 1: python recursive fibonacci function
def recur_fibo(n):
if n <= 1:
return n
else:
return(recur_fibo(n-1) + recur_fibo(n-2))
nterms = 10
if nterms <= 0:
print("Plese enter a positive integer")
else:
print("Fibonacci sequence:")
for i in range(nterms):
print(recur_fibo(i))
Example 2: python fibonacci recursive
def Fibonacci( pos ):
if pos <= 1 :
return 0
if pos == 2:
return 1
n_1 = Fibonacci( pos-1 )
n_2 = Fibonacci( pos-2 )
n = n_1 + n_2
return n
nth_fibo = Fibonacci( 5 )
print (nth_fibo)
Example 3: fibonacci recursive python
class recur_fibo:
memory = {0: 1, 1:1}
def fibonacci(n):
if n in recur_fibo.memory:
return recur_fibo.memory[n]
else:
recur_fibo.memory[n] = recur_fibo.fibonacci(n-1) + recur_fibo.fibonacci(n-2)
return recur_fibo.memory[n]
if __name__ == "__main__":
value = recur_fibo.fibonacci(200)
print(value)