/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 vote90 views1 answer
Python detect lines in document
Python
0 vote140 views1 answer
Seaborn heatmap text labels
Python
1 vote163 views1 answer
How to make a pairs plot with pandas
Python
1 vote234 views2 answers
Is : and :: the same in python slice
Python
6 votes181 views1 answer
Pip freeze showing @ and not showing package version
Python
0 vote167 views1 answer
Setup python in windows tikinter
Python
4 votes136 views3 answers
Print bold python
Python
0 vote382 views1 answer
Django on delete set default
Python Django
5 votes156 views3 answers
Argparse list
Python
2 votes146 views2 answers
How to change colour of rows in csv using pandas
Python