/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 vote138 views1 answer
How to remove some lines border from plt plot
Python
0 vote113 views1 answer
How to install neat
Python
0 vote105 views1 answer
0x80370102 kali linux
Python
1 vote140 views1 answer
Correr servidor django
Python
0 vote104 views2 answers
Dice Roller in Python
Python
-1 vote115 views3 answers
Open csv from url python
Python
10 votes98 views3 answers
Discord table generator
Python
0 vote129 views1 answer
Django router multiple pk
Python Django
0 vote95 views1 answer
Kivy video recorder
Python
2 votes103 views2 answers
Pandas average every n rows
Python