/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 vote173 views1 answer
Proper function pandas
Python
2 votes162 views1 answer
Curses module python on windows
Python
0 vote181 views1 answer
How to add subtitle matplotlib
Python
7 votes310 views1 answer
Health definition
Python
0 vote194 views1 answer
Access data frame element by loc
Python
0 vote215 views1 answer
Search object in array python
Python
1 vote184 views1 answer
Python recursive sum of digit
Python
13 votes181 views6 answers
Python format decimal
Python
22 votes176 views3 answers
Python except error as e
Python
0 vote197 views2 answers
Mysql config not found
Python