/Python/Fibonacci series python recursion

Fibonacci series python recursion

# By recursion
def fib(n):
    if n == 1 or n == 2:
        return 1 
    else:
        return(fib(n-1) + fib(n-2))
        
n = 6
for i in range(1,n+1):
    print(fib(i))

Fibonacci sequence python

# WARNING: this program assumes the
# fibonacci sequence starts at 1
def fib(num):
  """return the number at index num in the fibonacci sequence"""
  if num <= 2:
    return 1
  return fib(num - 1) + fib(num - 2)


print(fib(6))  # 8

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))

-1

Source: pythonclass.in

Similar codes

0 vote160 views1 answer
Multi hot encode pandas column
Python
21 votes184 views5 answers
Base64 encode python
Python
10 votes167 views1 answer
Dataframe copy
Python
0 vote175 views1 answer
No module named googlesearch
Python
5 votes169 views1 answer
Multinomial regression scikit learn
Python
0 vote200 views4 answers
Read file from google drive colab
Python
37 votes177 views1 answer
Time format conversion in python
Python
1 vote181 views1 answer
Running setup.py bdist_wheel for opencv-python: still running...
Python
0 vote205 views1 answer
Django show image in admin page
Python Django
6 votes172 views1 answer
Python round number numpy
Python