/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 vote211 views1 answer
Substring in a django template?
Python
0 vote227 views1 answer
Pprint don't sort
Python
0 vote222 views1 answer
How to fill a shape with colour in python turtle
Python
0 vote225 views1 answer
How to convert utf-16 file to utf-8 in python
Python
2 votes167 views1 answer
Jupyter lab
Python
0 vote213 views1 answer
Dive split of numeric values dataframes for categorical vlaues
Python
1 vote216 views1 answer
How to store a number in a variable python
Python
1 vote214 views1 answer
Python file.write is not writing whole line
Python
1 vote229 views1 answer
What is nea in python
Python
0 vote195 views9 answers
Python how to count ever yfile in fodler
Python