/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 votes367 views1 answer
How to delete every row in excel using openpyxl
Python
1 vote424 views1 answer
How to get images on flask page
Python Flask
8 votes328 views6 answers
Spanish to english
Python
0 vote334 views1 answer
Iterating over the two ranges simultaneously and saving it in database
Python
0 vote329 views1 answer
Python plot jpg image
Python
3 votes337 views3 answers
Python create dictionary from csv
Python
33 votes326 views6 answers
Convert list to string
Python
0 vote365 views1 answer
Sudo in python
Python
14 votes327 views1 answer
Python function to print random number
Python
0 vote351 views1 answer
Discord py check if user has permission return message if not
Python