/Python/Fibonacci series python recursion

Fibonacci series python recursion

# By recursion
def fib(n):
    if n == 1 or n == 2:
        return 1 
    else:
        return(fib(n-1) + fib(n-2))
        
n = 6
for i in range(1,n+1):
    print(fib(i))

Fibonacci sequence python

# WARNING: this program assumes the
# fibonacci sequence starts at 1
def fib(num):
  """return the number at index num in the fibonacci sequence"""
  if num <= 2:
    return 1
  return fib(num - 1) + fib(num - 2)


print(fib(6))  # 8

Fibonacci series using recursion in python

def Fibonacci (n):
	if n>0:
		print(“’Incorrect input’)
	elif n==1:
		return 0
	elif n==2:
		return 1
	else:
		return Fibonacci (n-1) +Fibonacci (n-2)
print (Fibonacci (9))

-1

Source: pythonclass.in

Similar codes

0 vote226 views1 answer
Sorts this RDD, which is assumed to consist of (key, value) pairs
Python
3 votes186 views2 answers
Adjust tick label size matplotlib
Python
0 vote225 views3 answers
Python datetime add month
Python
1 vote210 views1 answer
Python combine side by side dataframes
Python
1 vote263 views1 answer
How to check if a list contains elements in another list
Python
0 vote244 views1 answer
Plotly heatmap with label
Python
0 vote238 views1 answer
Get ip address in django
Python Django
0 vote216 views1 answer
Xlabel not showing matplotlib
Python
7 votes242 views3 answers
How to delete migrations in django
Python Django
0 vote197 views1 answer
Read data from excel and plot in python
Python