/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 vote140 views1 answer
Python Tkinter timer animation
Python
0 vote126 views1 answer
Python count bits
Python
2 votes182 views1 answer
Python print dictionary line by line
Python
0 vote117 views1 answer
NaN stand for python
Python
3 votes136 views2 answers
Pandas check length of string
Python
38 votes136 views2 answers
How to file in python
Python
1 vote144 views1 answer
[Solved] TypeError: ‘numpy.float64’ object cannot be interpreted as an integer
Python
0 vote132 views1 answer
No module named 'django_hitcounter'
Python
9 votes128 views2 answers
How to read video in opencv python
Python
14 votes125 views2 answers
Python get username
Python