/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 vote350 views1 answer
Http404 django
Python Django
0 vote357 views3 answers
Print out session information django
Python
82 votes355 views6 answers
How to run requirements.txt in python
Python
14 votes330 views3 answers
Python csv to excel
Python
0 vote362 views1 answer
How to get all distinct substrings in a string python
Python
1 vote361 views1 answer
Can we use else without if in python
Python
0 vote320 views1 answer
Hover 777-286
Python
0 vote349 views1 answer
For loop with zip and enumerate
Python
7 votes363 views3 answers
Stack in python
Python
0 vote390 views1 answer
Foreignkey as users from a user group django
Python Django