/Python/Fibonacci series using recursion

Fibonacci series using recursion

def fib (n):
  if n == 0 or n ==1:
      return n  
  else:
        return fib(n-2) + fib(n-1)
#n = int(input("please enter a number  "))

n=10
for index,num in enumerate(range(n+1)):
     print(f"F{index} :", fib(num))

Source: onecompiler.com

Similar codes

1 vote77 views2 answers
Tkinter text color button
Python
0 vote122 views2 answers
Dataframe change specicf values in column
Python
12 votes125 views6 answers
How to make a list python
Python
0 vote95 views1 answer
Range of y & x in scatter
Python
0 vote127 views1 answer
Save variable to use in other jupyter notebook
Python
0 vote108 views1 answer
Python merge two lists alternating
Python
5 votes121 views2 answers
Matplotlib add space between subplots
Python
0 vote111 views1 answer
Python requests ignore SSL
Python
0 vote71 views2 answers
Python fraction simplify
Python
0 vote119 views1 answer
Star psf
Python