/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

1 vote186 views1 answer
Xaxis matplotlib
Python
0 vote198 views1 answer
111
Python
0 vote158 views1 answer
Insert Multiple Images to Excel with Python
Python
0 vote214 views2 answers
Jsonresponse status code django
Python Django
2 votes161 views2 answers
Python redis
Python
19 votes239 views1 answer
Python substring
Python
0 vote125 views1 answer
There is no difference in R between a string scalar and a vector of strings
Python
0 vote162 views1 answer
Files and exceptions not working python
Python
0 vote188 views1 answer
Colored text in py
Python
0 vote194 views1 answer
Controlliing a fill pattern in matplotlib
Python