/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 vote164 views1 answer
Minio python create bucket
Python
0 vote170 views2 answers
Switching versions of python
Python
2 votes200 views2 answers
Open terminal in python
Python
1 vote120 views2 answers
Functions in python 3
Python
2 votes154 views1 answer
Get email address from string python
Python
0 vote203 views1 answer
Pandas fill missing index values
Python
1 vote188 views1 answer
Download from radio javan python
Python
13 votes175 views1 answer
Configure funCtion in tkinter
Python
0 vote161 views0 answer
Python
0 vote168 views1 answer
What is proc file
Python