/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 vote128 views1 answer
Pandas calculate iqr
Python
1 vote134 views1 answer
Python convert to percentage
Python
0 vote129 views1 answer
Values missing comparing datasets
Python
8 votes133 views1 answer
Jupyter column limit pd
Python
0 vote145 views1 answer
Idiomatic python
Python
27 votes173 views4 answers
Create dictionary python from two lists
Python
3 votes127 views2 answers
How to create a network scanner in python
Python
0 vote133 views1 answer
Tkinter datatypes
Python
0 vote128 views1 answer
Fill a column based on values in another column pandas
Python
0 vote124 views1 answer
Kroki - hello.dot
Python