/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 vote228 views1 answer
How to save the command result with ! in python
Python
1 vote233 views2 answers
Django create multiple objects
Python
15 votes227 views3 answers
Sum of 2 numbers in python
Python
0 vote231 views1 answer
Seaborn boxplot legend color
Python
0 vote222 views1 answer
Python loading image file requires absolute path
Python
38 votes231 views3 answers
Pil python install
Python
0 vote222 views1 answer
Python create dataframe by row
Python
0 vote220 views1 answer
Flask decoding base 64 image
Python
1 vote244 views2 answers
Flask bootstrap
Python Flask
0 vote234 views1 answer
Set environment variable flask app
Python