/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

8 votes266 views2 answers
Python find all positions of element in list
Python
3 votes264 views3 answers
Extract domain name from url python
Python
2 votes267 views1 answer
Select 2 cols from dataframe python pandas
Python
0 vote275 views1 answer
Any value in list will retrun true python
Python
1 vote222 views1 answer
Typeerror: list indices must be integers or slices, not str
Python
2 votes291 views2 answers
Python jinja2 loop dict
Python
0 vote244 views1 answer
See you tomorrow in italian
Python
4 votes280 views3 answers
Python difference in time
Python
0 vote278 views1 answer
Updating many to many field in django using pk
Python
0 vote280 views1 answer
Pretty print list python
Python