/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

3 votes185 views2 answers
Python initialize a 2d array
Python
3 votes189 views1 answer
Extended euclidean python
Python
0 vote171 views1 answer
How to kick and ban members with discord.py
Python
0 vote208 views1 answer
Python get number of arguments of a function
Python
27 votes195 views6 answers
Create a empty dataframe
Python
0 vote178 views1 answer
Access value of posted object python
Python
0 vote227 views1 answer
Cool codes for python
Python
1 vote195 views1 answer
SSL handshake failed: localhost:27017
Python
4 votes192 views5 answers
Add a new column to numpy array
Python
0 vote214 views1 answer
Response 200 python
Python