/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

1 vote315 views1 answer
Difference between __str__ and __repr__
Python
0 vote367 views1 answer
Fetch json array from mysql django
Python
0 vote323 views1 answer
Find rows in dataframe from another dataframe python
Python
0 vote378 views1 answer
Prefetched_related django rest framework
Python
0 vote367 views2 answers
Python x y coordinates
Python
0 vote340 views2 answers
How to decode hexadecimal in python
Python
3 votes316 views1 answer
Pandas concat and reset index
Python
6 votes346 views4 answers
Extract numbers from string python
Python
0 vote335 views1 answer
Finding the maximum element from a matrix with Python numpy.argmax()
Python
0 vote362 views1 answer
Python pipe select where dedup
Python