/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 vote371 views1 answer
Free download django app for windows 10
Python Django
0 vote312 views1 answer
UserWarning: Failed to initialize NumPy: numpy.core.multiarray failed to import (Triggered internally at
Python
0 vote334 views1 answer
Comment arrêter l'exécution d'un programme python
Python
2 votes301 views1 answer
Python copy a 2D list
Python
0 vote332 views1 answer
Python file hashlib
Python
0 vote385 views1 answer
How to change the height of an input in python tkinter
Python
4 votes386 views1 answer
How to get the parent class using super python
Python
0 vote353 views1 answer
Python get_loc not returning number
Python
0 vote678 views1 answer
Recurrent neural network pytorch
Python
0 vote371 views1 answer
Flask session auto logout in 5 mins
Python