/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

13 votes281 views2 answers
Python programming online editor
Python
1 vote282 views1 answer
Permanent redirect django
Python
0 vote289 views1 answer
Python log10
Python
0 vote255 views2 answers
Importerror: cannot import name
Python
0 vote265 views1 answer
How to find the longest string python
Python
1 vote294 views1 answer
E: Unable to locate package python3-pip docker file
Python
1 vote263 views1 answer
Geodataframe change crs
Python
1 vote275 views1 answer
Fill pixels with zeros python opencv
Python
0 vote294 views1 answer
Ordering column names sensibly in pandas
Python
1 vote286 views1 answer
Pandas resample backfill
Python