/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

3 votes259 views1 answer
Annotation type of collection python
Python
9 votes246 views6 answers
How to use print in python
Python
0 vote244 views1 answer
Time addition in python
Python
0 vote255 views1 answer
Python file naming conventions
Python
0 vote290 views1 answer
Flask server not reloading
Python Flask
43 votes253 views4 answers
Conda env
Python
0 vote259 views1 answer
ImportError: cannot import name 'StringIO'
Python
12 votes266 views1 answer
Copy a dict in python
Python
0 vote243 views1 answer
Python replace list of ips from yaml file with new list
Python
8 votes267 views6 answers
How to make lists in python
Python