/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 vote221 views1 answer
Django rest framework default_authentication_classes
Python Django
36 votes181 views6 answers
Requirement.txt for python
Python
6 votes195 views1 answer
Display Max rows in a pandas dataframe
Python
3 votes188 views2 answers
Lda scikit learn
Python
0 vote198 views1 answer
When i press tab it shows ipynb_checkpoints/ in jupyter notebook
Python
0 vote183 views1 answer
Excel write column
Python
1 vote198 views1 answer
$ sudo pip install pdml2flow-frame-inter-arrival-time
Python
0 vote178 views1 answer
Python get output
Python
0 vote227 views1 answer
Listing of django model types
Python Django
1 vote219 views2 answers
Django in conda
Python Django