/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 vote279 views1 answer
Vscode python workding directory
Python
4 votes295 views2 answers
Python exception with line number
Python
3 votes317 views2 answers
Python - remove scientific notation
Python
1 vote349 views1 answer
Django models.py convert DateTimeField to DateField
Python Django
0 vote281 views1 answer
Skip error python
Python
1 vote288 views1 answer
Check if can convert to float python
Python
0 vote307 views2 answers
AttributeError: 'Series' object has no attribute 'toarray'
Python
0 vote294 views1 answer
Numeric up down python tkinter
Python
0 vote292 views1 answer
Np.divide
Python
0 vote303 views2 answers
Plt axis tick color
Python