/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 vote182 views1 answer
Grading system in python with nested if
Python
0 vote183 views1 answer
Turn columns into one column as list python
Python
4 votes186 views1 answer
Histogram | creating a histogram
Python
0 vote182 views1 answer
Program in python to print first 10 natural number.
Python
1 vote188 views1 answer
Pywhatkit
Python
27 votes186 views2 answers
Rename column name pandas dataframe
Python
0 vote195 views1 answer
Cannot cast type smallint to boolean django
Python
30 votes220 views6 answers
Df drop column
Python
0 vote200 views1 answer
Compare times python
Python
0 vote197 views1 answer
Django template add numbers
Python