/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

4 votes201 views1 answer
How to find the last item of a list
Python
3 votes178 views3 answers
Download playlist from youtube python
Python
-1 vote208 views2 answers
Reading tsv file in python
Python
0 vote242 views1 answer
Python create empty dictionary with keys
Python
0 vote178 views1 answer
Django swagger settings https
Python
0 vote191 views1 answer
Python stop the whole function
Python
-2 votes173 views2 answers
How to find eigenvalues in python
Python
2 votes184 views1 answer
How to add a function in python
Python
189 votes282 views10 answers
New Year's Eve
Python
0 vote209 views1 answer
Extract area code from phone number python
Python