/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 vote145 views1 answer
Arduino - Send Commands with Serial Communication with python
Python
18 votes152 views6 answers
ModuleNotFoundError: No module named
Python
0 vote158 views1 answer
Legend outside subplot not displayed
Python
0 vote153 views1 answer
TypeError: the 'int' object is not callable error
Python
0 vote148 views1 answer
Number of unique pairs in columns pandas
Python
0 vote148 views1 answer
Python string match http
Python
1 vote131 views1 answer
Why when I merge my label cluster with my dataframe i get more row
Python
0 vote139 views1 answer
Python while variable is not
Python
0 vote154 views2 answers
Shared memory python
Python
0 vote183 views2 answers
Python replace matching string
Python