/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 vote202 views1 answer
Python regex replace point with underscore
Python
0 vote169 views1 answer
Python jinja2 from string
Python
1 vote159 views1 answer
Pandas sample rows
Python
1 vote184 views1 answer
What is serialization in django
Python Django
0 vote144 views1 answer
Get one from dataloader
Python
0 vote168 views1 answer
NameError: name 'CAP_PROP_FPS' is not defined
Python
0 vote145 views1 answer
How ti maek a prinyt comnad i pyuthon
Python
0 vote185 views2 answers
Builtwith python
Python
0 vote158 views2 answers
Python unsupported operand type(s) for & 'str' and 'str'
Python
3 votes158 views3 answers
Python check internet connection
Python