/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

12 votes216 views4 answers
Python algorithm generator
Python
0 vote223 views1 answer
Lamda in f string
Python
2 votes220 views1 answer
How to add a function in python
Python
0 vote224 views1 answer
Load url in jupyterlab
Python
33 votes201 views2 answers
Find a largest number in function list python
Python
0 vote218 views1 answer
1: for python position
Python
0 vote227 views1 answer
Find allurl in text python
Python
0 vote201 views1 answer
Python series get value
Python
0 vote231 views1 answer
Python check variable is tuple
Python
1 vote209 views1 answer
How to scroll down to end of page in selenium python
Python