/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

16 votes107 views4 answers
How to open a website in python
Python
0 vote117 views1 answer
How to extract dictionary value from string in python
Python
0 vote117 views1 answer
Compose functions python
Python
1 vote108 views1 answer
How to watermark a video using python
Python
5 votes109 views1 answer
Python iteratable with inedx
Python
0 vote106 views1 answer
Python immutable dataclass
Python
0 vote111 views2 answers
Torch.unsqueeze
Python
41 votes116 views6 answers
How to make a virtual environment in python
Python
0 vote129 views1 answer
Herencia python
Python
7 votes115 views5 answers
Convert categorical variable to numeric python
Python