/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

0 vote86 views1 answer
Calculate Euclidean Distance in Python using norm()
Python
6 votes79 views3 answers
Tensorflow install using conda
Python
0 vote72 views1 answer
Python + credit-german.csv + class
Python
-1 vote71 views1 answer
Python plt show legend
Python
39 votes75 views6 answers
Remove spaces from string python
Python
76 votes102 views6 answers
For loop in python
Python
3 votes81 views1 answer
Join two numpy 2d array
Python
1 vote95 views1 answer
Flask authentication user without database
Python Flask
54 votes73 views2 answers
How to run django requirement.txt
Python
1 vote61 views1 answer
Make lists for each 2 items in a list
Python