/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

1 vote310 views1 answer
$ sudo pip install pdml2flow-frame-inter-arrival-time
Python
3 votes319 views2 answers
Apply lambda function to multiple columns pandas
Python
2 votes333 views1 answer
Count the number of rows in a database table in Django
Python
-2 votes316 views1 answer
Come scaricare moduli pyton
Python
12 votes349 views6 answers
Set python 3 as default mac
Python
2 votes313 views1 answer
Python global variable across files
Python
0 vote305 views2 answers
Can data scientists become software developer
Python
0 vote346 views1 answer
How to instal django cities
Python Django
36 votes354 views2 answers
ModuleNotFoundError: No module named 'sklearn'
Python
0 vote335 views2 answers
Use reshape in python with zeros
Python