/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 vote280 views1 answer
Change float column to percentage python
Python
1 vote291 views1 answer
Isnull().mean() python
Python
0 vote271 views1 answer
Remove base from terminal anaconda
Python
8 votes292 views5 answers
Pop vs remove python
Python
0 vote326 views1 answer
2pac
Python
1 vote277 views2 answers
String array to float array python
Python
8 votes293 views2 answers
How to earse special chrat¥cter from string in python
Python
1 vote260 views1 answer
Markers seaborn
Python
1 vote282 views1 answer
Cannot import name 'imputer'
Python
40 votes271 views3 answers
Python push to dataframe pandas
Python