/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 vote137 views1 answer
Np.all
Python
0 vote135 views1 answer
Convert string input into a nested tuple in python
Python
1 vote179 views1 answer
Radiobuttons django
Python Django
0 vote141 views1 answer
How to know if i'm in a virtual environment
Python
5 votes172 views2 answers
Django form password field
Python Django
3 votes132 views1 answer
Python docker
Python
5 votes159 views2 answers
Groupby and list
Python
2 votes137 views1 answer
How to open incognito tab using webbrowser
Python
2 votes145 views1 answer
Python check if string is date format
Python
1 vote170 views1 answer
Correr servidor django
Python Django