/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

59 votes100 views6 answers
How to get current date in python
Python
78 votes102 views6 answers
Wait in python
Python
1 vote107 views1 answer
[Solved] TypeError: can’t multiply sequence by non-int of type str
Python
0 vote112 views3 answers
Repeat
Python
1 vote103 views2 answers
Speech enhancement techniques
Python
5 votes121 views2 answers
Pyaudio not installing ubuntu
Python
0 vote134 views1 answer
ImportError: matplotlib is required for plotting when the default backend "matplotlib" is selected.
Python
0 vote107 views1 answer
Seaborn pandas annotate
Python
0 vote125 views1 answer
How to dynamically search for a class variable in python
Python
0 vote123 views1 answer
How to install a python packagae
Python