/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 vote230 views1 answer
Python loading image file requires absolute path
Python
3 votes219 views2 answers
Python get domain from url
Python
0 vote232 views1 answer
Programme phyton pour realiser un programme qui transforme une image en niveau de gris
Python
0 vote240 views1 answer
Python beautifulsoup write to file
Python
-2 votes234 views1 answer
Django modelform datetime
Python
0 vote253 views1 answer
Flask send email gmail
Python
1 vote238 views3 answers
Django logout user
Python Django
0 vote242 views1 answer
Python program to multiply two numbers and multiply the answer with 2nd variables
Python
7 votes273 views2 answers
Mongodb aggregate count
Python
0 vote248 views2 answers
How to split string with comma in python
Python