/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

21 votes331 views6 answers
Python linear regression
Python
0 vote313 views2 answers
Python multiply 2 variables
Python
1 vote297 views1 answer
Python website example
Python
0 vote313 views1 answer
Websocket api python on close
Python
2 votes322 views3 answers
Python how to get directory of script
Python
16 votes299 views1 answer
Python reimport py file
Python
1 vote312 views1 answer
Import tknter
Python
6 votes330 views6 answers
Python dict
Python
0 vote338 views1 answer
How to use python-socker.io with fast api
Python
60 votes335 views6 answers
Python current date
Python