/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

9 votes158 views2 answers
Modify dict key name python
Python
46 votes142 views6 answers
Comment in python
Python
5 votes135 views1 answer
Python plot multiple lines in same figure
Python
0 vote128 views1 answer
Cbv uk django
Python
1 vote147 views1 answer
How to count stopwords in df
Python
7 votes142 views2 answers
Make a condition statement on column pandas
Python
2 votes137 views2 answers
Iterate through attributes of class python
Python
0 vote95 views1 answer
Snipe cmd python.py
Python
1 vote327 views1 answer
Pandas shift all columns
Python
1 vote165 views1 answer
Like in mysqldb python
Python