/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

3 votes190 views2 answers
Count number of each item in list python
Python
2 votes181 views2 answers
How to send a message from google form to a python
Python
0 vote252 views1 answer
Pandas combine two data frames with same index and same columns
Python
18 votes194 views3 answers
Select specific rows from dataframe in python
Python
0 vote187 views1 answer
Python coule nod import the module virtualenvwrapper.hook_loader
Python
0 vote184 views1 answer
Import stock data from yahoo finance
Python
11 votes202 views3 answers
Import RandomForestClassifier
Python
14 votes255 views5 answers
Permutations python
Python
2 votes196 views2 answers
Python number and name of weekday
Python
0 vote190 views1 answer
Create virtual environments python
Python