/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 vote394 views1 answer
Syntax of calloc
Python
0 vote341 views1 answer
Change python 3.5 to 3.6 ubuntu
Python
0 vote417 views1 answer
Access google transalte pandas
Python
1 vote389 views1 answer
Python swap function
Python
6 votes376 views2 answers
Django read mesage
Python
18 votes346 views2 answers
Lists to dictionary python
Python
1 vote376 views1 answer
Python connectionreseterror: [winerror 10054] an existing connection was forcibly closed by the remote host
Python
0 vote337 views1 answer
How to take input in python as string and convert into integer list
Python
6 votes344 views1 answer
How to get just the filename in python
Python
1 vote349 views1 answer
Can't convert np.ndarray of type numpy.object_.
Python