/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

9 votes195 views3 answers
A value is trying to be set on a copy of a slice from a DataFrame. Try using .loc[row_indexer,col_indexer] = value instead
Python
0 vote193 views2 answers
Tkinter progresse bar color
Python
12 votes202 views2 answers
Python sorted function descending
Python
11 votes204 views3 answers
Dataframe delete row
Python
3 votes193 views2 answers
Resize numpy array image
Python
0 vote240 views1 answer
Python string with si suffix to number
Python
0 vote214 views2 answers
Pyttsx3 save to file
Python
10 votes209 views2 answers
Prime number
Python
1 vote185 views1 answer
Python get latest edited file from any directory
Python
2 votes240 views2 answers
Panda - subset based on column value
Python