fibonacci series

def fib(n):
  lisp = []
  
  for i in range(n):
    if len(lisp) < 3:
      if len(lisp) == 0:
        lisp.append(0)
      else:
        lisp.append(1)
    
    else:
      lisp.append(lisp[len(lisp)-1]+lisp[len(lisp)-2])
  
  return lisp

# Function for nth Fibonacci number 
  
def Fibonacci(n): 
    if n<0: 
        print("Incorrect input") 
    # First Fibonacci number is 0 
    elif n==0: 
        return 0
    # Second Fibonacci number is 1 
    elif n==1: 
        return 1
    else: 
        return Fibonacci(n-1)+Fibonacci(n-2) 
  
# Driver Program 
  
print(Fibonacci(9)) 
  
#This code is contributed by Saket Modi 

#include <stdio.h>int fib(int n){int t0=0,t1=1,s=0,i;if(n<=1) return n;for(i=2;i<=n;i++)    {        s=t0+t1;        t0=t1;        t1=s;    }return s;}int rfib(int n){if(n<=1)return n;returnrfib(n-2)+rfib(n-1);}int F[10];int mfib(int n){if(n<=1)    {F[n]=n;return n;    }else    {if(F[n-2]==-1)F[n-2]=mfib(n-2);if(F[n-1]==-1)
F[n-1]=mfib(n-1);F[n]=F[n-2]+F[n-1];returnF[n-2]+F[n-1];    }}int main(){int i;for(i=0;i<10;i++)F[i]=-1;printf("%d \n",mfib(5));return0;}