/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 vote222 views1 answer
Int to hex python without 0x
Python
13 votes273 views3 answers
How to create tkinter window
Python
0 vote213 views1 answer
Np.divide
Python
1 vote228 views1 answer
Number of times a value occurs in dataframne
Python
0 vote244 views1 answer
Python def text
Python
26 votes219 views2 answers
Python time library
Python
0 vote258 views1 answer
Django data from many to many field in template
Python Django
4 votes190 views2 answers
Django queryset group by
Python
0 vote187 views1 answer
Set permissions role discord.py
Python
0 vote206 views1 answer
Is_isogram
Python