/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 vote111 views1 answer
Array Creation in Numpy
Python
0 vote109 views1 answer
Django form field add attrs
Python
4 votes109 views2 answers
Python Program to count the number of lowercase letters and uppercase letters in a string.
Python
8 votes121 views3 answers
Np.arange in python
Python
1 vote128 views2 answers
Python strptime milliseconds
Python
7 votes112 views1 answer
Pd dataframe get column names
Python
2 votes115 views1 answer
How to compare two text files in python
Python
6 votes117 views2 answers
Update jupyter notebook
Python
0 vote135 views1 answer
'djdt' is not a registered namespace
Python
0 vote189 views1 answer
RuntimeError: Expected object of type torch.FloatTensor but found type torch.cuda.FloatTensor for argument
Python