/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 votes261 views2 answers
Python strptime format codes
Python
0 vote246 views1 answer
Windows python absolute path
Python
1 vote250 views1 answer
Torch tensor equal to
Python
1 vote267 views2 answers
Program to print duplicates from a list of integers in python
Python
0 vote268 views1 answer
Detect operating system using python
Python
0 vote241 views1 answer
Get the name of a current script in python
Python
0 vote246 views1 answer
Pass query params django template
Python Django
1 vote233 views1 answer
Python program to give shop name
Python
0 vote246 views1 answer
Validating credit card numbers
Python
10 votes242 views5 answers
Pandas convert float to int
Python