/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

189 votes246 views10 answers
New Year's Eve
Python
9 votes242 views2 answers
Flask flash
Python
0 vote236 views1 answer
Matplotlib show grid for log or logit
Python
0 vote264 views1 answer
Python how to print something at a specific place
Python
0 vote230 views1 answer
Encrypt password with sha512 + python
Python
0 vote230 views2 answers
Python create gif
Python
0 vote231 views1 answer
How to use import command in python
Python
1 vote266 views2 answers
Install fasttext python
Python
-1 vote229 views2 answers
Python choose function
Python
0 vote255 views1 answer
Remove all integers from list python
Python