/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 vote378 views1 answer
Rom pathlib import Path # Build paths inside the project like this: BASE_DIR / 'subdir'. BASE_DIR = Path(__file__).resolve().parent.parent
Python
0 vote304 views1 answer
Openai python
Python
7 votes308 views3 answers
How to add multiple commands to tkinter button
Python
5 votes332 views2 answers
Python string replace by index
Python
76 votes365 views6 answers
Python iterate through list
Python
0 vote323 views1 answer
Tkinter centre a button on 1920x1080
Python
0 vote310 views1 answer
Derivative of multivariable function pytorch
Python
1 vote297 views1 answer
Nan in python what?
Python
2 votes412 views1 answer
Django rest framework viewset perform_update
Python Django
0 vote328 views1 answer
Python integrated with activeX
Python