/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 vote125 views1 answer
Python apply function to list
Python
12 votes107 views3 answers
How to open any application using python
Python
2 votes129 views1 answer
Django register models
Python Django
0 vote121 views1 answer
How to make bak files with python
Python
18 votes111 views4 answers
Python flatten a list of lists
Python
1 vote130 views1 answer
Display category field in django admin
Python Django
0 vote115 views1 answer
Python multiple items in with statment
Python
-4 votes126 views5 answers
Current django version
Python Django
0 vote121 views1 answer
Spyder - identation
Python
0 vote108 views1 answer
How to add to a variable in a for loop
Python