/Python/Fibonacci series in python using recursion

Fibonacci series in python using recursion

Fibonacci series using recursion in python

def fibonacci(n):
    if n <= 1:
          return n
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)

n = int(input())
result = fibonacci(n)
print(result)

Source: learning.ccbp.in

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))

Source: pythonclass.in

Fibonacci series using recursion in python

def fibonacci(n):
    if n <= 1:
          return n
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)

n = int(input())
result = fibonacci(n)
print(result)

Source: learning.ccbp.in

Similar codes

1 vote212 views1 answer
Python divide one column by another
Python
71 votes136 views10 answers
Sus sus sus
Python
-1 vote192 views1 answer
Python import from string
Python
0 vote197 views1 answer
Sort for Linked Lists python
Python
2 votes174 views1 answer
Pygame how to draw a rectangle
Python
0 vote252 views1 answer
Annot identify image file '/home/ellis/CB/Django-Ecommerce/media_root/default.jpg'
Python Django
-1 vote179 views1 answer
Calculate quantiles python
Python
0 vote185 views1 answer
Reg.fit(x_train, y_train) TypeError: fit() missing 1 required positional argument: 'y'
Python
0 vote192 views1 answer
Any(iterable)
Python
0 vote164 views2 answers
Display pythonpath linux
Python