/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

1 vote98 views1 answer
How to custom page not found in django
Python
49 votes143 views10 answers
Reddit
Python
0 vote99 views1 answer
Parquet to dataframe
Python
0 vote95 views1 answer
Discord.py APK
Python
0 vote97 views1 answer
Drawing rectangle with border only in matplotlib
Python
3 votes101 views2 answers
Who invented python
Python
0 vote108 views1 answer
Starting variable name with underscore python
Python
2 votes105 views2 answers
Background image in python
Python
0 vote111 views1 answer
Flow of control in python
Python
0 vote111 views1 answer
How to draw squircle python
Python