/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

17 votes238 views6 answers
How to append to a list in python
Python
8 votes251 views4 answers
Print pandas version
Python
0 vote319 views1 answer
How to send image to template thats not in static flask
Python Flask
1 vote271 views1 answer
Create new column using dictionary padnas
Python
0 vote253 views1 answer
Create schema dynamo revit
Python
4 votes207 views1 answer
Time.time()
Python
1 vote279 views1 answer
Pip install mysqldb
Python
0 vote256 views1 answer
Linear congruential generator in python
Python
2 votes246 views1 answer
Get input pandas
Python
1 vote274 views1 answer
Number of database queries django
Python Django