/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 vote303 views1 answer
How to close windows in selenium python without quitting the browser
Python
3 votes308 views2 answers
Python initialize list
Python
6 votes281 views2 answers
Numpy ones
Python
0 vote315 views1 answer
Zoom in librosa.display.specshow()
Python
0 vote314 views1 answer
Multiple args for pandas apply
Python
0 vote302 views1 answer
Python how to request query string korean encode
Python
0 vote283 views1 answer
Gspread how to put shhet number in a variable
Python
-1 vote310 views2 answers
Append multiple elements
Python
0 vote351 views1 answer
For loop in django template css
Python Django
0 vote288 views1 answer
Panda3d attach to bone
Python