/Python/Fibonacci series using dynamic programmig approach

Fibonacci series using dynamic programmig approach

def fib(n, solved):
 
    # Base case
    if n == 0 or n == 1 :
        solved[n] = n
 
    # If the value is not calculated yet then calculate it
    if solved[n] is None:
        solved[n] = fib(n-1, solved)+fib(n-2, solved)
 
    # return the value from table for n
    return solved[n]

n = 12
solved = [None]*(n+1)
fib(n, solved)
for i, num in enumerate(solved):
	print(i, num)

Source: codefinity.com

Similar codes

0 vote191 views1 answer
Python minecraft server python gui
Python
31 votes182 views6 answers
Try except
Python
46 votes208 views4 answers
How to get the type of a variable in python
Python
2 votes191 views1 answer
Tf.reduce_sum()
Python
10 votes208 views5 answers
Opencv Webcam
Python
1 vote208 views2 answers
Types of all columns pandas
Python
0 vote197 views1 answer
How to standardize the image data to have values between 0 and 1
Python
0 vote198 views1 answer
Remove percentage in python
Python
0 vote201 views1 answer
Get the mean of all not nan values
Python
1 vote190 views1 answer
Como deixar todas as letras maiusculas no python
Python