/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

0 vote247 views1 answer
Pandas selection row/columns
Python
0 vote287 views1 answer
Make my own rabbit bomb using python
Python
0 vote299 views1 answer
Combine for and if python
Python
0 vote257 views1 answer
Pandas row printed horizontally
Python
4 votes292 views2 answers
__call__ python
Python
2 votes259 views1 answer
Number to list in python
Python
2 votes269 views1 answer
Sacar la posicion en una lista python
Python
0 vote271 views1 answer
Nth term of gp in python when 2,3 terms given
Python
0 vote282 views1 answer
How to block empty space python login
Python
0 vote251 views1 answer
Python create directory if non existent
Python