/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

11 votes116 views4 answers
Multiple line input python
Python
0 vote135 views2 answers
Terneray operator in python
Python
0 vote135 views1 answer
Super().__init__(pos, model) in python
Python
2 votes131 views1 answer
Numpy how to slice individual columns
Python
0 vote126 views1 answer
TypeError: the 'int' object is not callable error
Python
1 vote168 views1 answer
Make averages on python
Python
0 vote136 views2 answers
Model.layers[4].set_weights([embedding_matrix])
Python
3 votes134 views1 answer
Pickle load pickle file
Python
0 vote118 views2 answers
Address already in use
Python
0 vote80 views1 answer
"api_view" is not defined django
Python