/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 vote252 views1 answer
Pandas automatic allignment of columns
Python
17 votes269 views3 answers
Matplotlib title
Python
1 vote257 views1 answer
Delimiter pandas
Python
0 vote267 views1 answer
Pytorch dill model save
Python
2 votes287 views1 answer
Python check my gpu
Python
0 vote254 views1 answer
Hms bagle
Python
37 votes289 views5 answers
TypeError: 'NoneType' object is not subscriptable
Python
1 vote255 views1 answer
Raw input example python
Python
0 vote250 views1 answer
Max of double array python
Python
68 votes257 views6 answers
Python dict sort by value
Python