/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 vote128 views1 answer
Django changing boolean field from view
Python
2 votes138 views1 answer
Edge detection opencv python
Python
0 vote130 views1 answer
Tesor to numpy
Python
-1 vote129 views1 answer
Extracting values in pandas
Python
0 vote138 views1 answer
Dict .get none replace
Python
2 votes118 views1 answer
How to get the list of discord server members?
Python
6 votes127 views3 answers
Pandas drop row by condition
Python
9 votes148 views4 answers
For if else one line python
Python
0 vote128 views2 answers
Torch.unsqueeze
Python
0 vote128 views2 answers
Pytest using tempfile
Python