/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

11 votes314 views5 answers
Python sorted lambda
Python
0 vote309 views1 answer
How to increase size of graph in jupyter
Python
2 votes297 views1 answer
Python no module named
Python
0 vote306 views1 answer
Aritmetics to a value in a dict python
Python
0 vote282 views1 answer
How to close turle loop
Python
0 vote295 views1 answer
No limit row pandas
Python
3 votes291 views1 answer
Python función enumerate
Python
0 vote311 views1 answer
Check cudann
Python
0 vote302 views1 answer
Convert integer unix to timestamp python
Python
1 vote286 views1 answer
How to take input complex number in python
Python