fibonacci sequence python recursive code example

Example 1: python recursive fibonacci function

# Python program to display the Fibonacci sequence

def recur_fibo(n):
   if n <= 1:
       return n
   else:
       return(recur_fibo(n-1) + recur_fibo(n-2))

nterms = 10

# check if the number of terms is valid
if nterms <= 0:
   print("Plese enter a positive integer")
else:
   print("Fibonacci sequence:")
   for i in range(nterms):
       print(recur_fibo(i))

Example 2: fibonacci sequence python

# WARNING: this program assumes the
# fibonacci sequence starts at 1
def fib(num):
  """return the number at index num in the fibonacci sequence"""
  if num <= 2:
    return 1
  return fib(num - 1) + fib(num - 2)


print(fib(6))  # 8

Example 3: fibonacci recursive python

#fibonacci sequence with memory to increase the speed.
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)