/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

23 votes377 views1 answer
Python hour from datetime
Python
0 vote330 views1 answer
Python create type for heterogeneous dict
Python
1 vote370 views2 answers
Pyqt5 message box
Python
1 vote336 views1 answer
How to take index first and last in python in one way
Python
0 vote372 views1 answer
Get false positives from confusoin matrix
Python
1 vote343 views1 answer
Db_index django
Python
0 vote366 views1 answer
Python textbox
Python
1 vote349 views1 answer
Handle queries in ListView django
Python
17 votes356 views3 answers
Python get current file location
Python
5 votes384 views2 answers
Read matlab file in python
Python