/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 vote252 views1 answer
Django check if get parameter exists
Python Django
0 vote236 views1 answer
Perceptron multicouche scratch python
Python
1 vote247 views1 answer
Lausd clever
Python
0 vote257 views1 answer
Sxrf argument missing from post
Python
0 vote242 views1 answer
Camel case to snake case python
Python
0 vote240 views1 answer
Pip install contractions
Python
2 votes235 views1 answer
Find the number of nan per column pandas
Python
0 vote268 views3 answers
Get field from anther model in model form
Python
4 votes263 views4 answers
Flash messages django
Python
0 vote263 views1 answer
Basic pygame window
Python