/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 vote351 views1 answer
How to get a list of all variables in memory python
Python
2 votes348 views2 answers
Python check if internet is available
Python
0 vote404 views1 answer
How to config django templates with pathlib
Python Django
0 vote361 views1 answer
Run django using nssm
Python
0 vote346 views2 answers
Python longest word in string
Python
0 vote375 views1 answer
Python3 paramiko read stdout
Python
0 vote391 views1 answer
Find a file in python
Python
-1 vote351 views1 answer
Python curses resize window
Python
0 vote383 views1 answer
Reading a cell from another cell in colab
Python
1 vote342 views1 answer
Data structures and algorithms in python
Python