/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 vote151 views2 answers
How to return a missing element in python
Python
0 vote176 views1 answer
Python consecutive numbers difference between
Python
1 vote211 views1 answer
Jinja2 template import html with as
Python
0 vote244 views1 answer
|safe django
Python Django
-1 vote151 views1 answer
TypeError: 'tuple' object does not support item assignment
Python
1 vote163 views1 answer
Python check if file has content
Python
0 vote272 views1 answer
Or operator in django queryset
Python Django
-2 votes206 views9 answers
Django
Python Django
0 vote150 views1 answer
Django iterating through objects
Python Django
0 vote147 views1 answer
Start and end index in python
Python