/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

1 vote200 views3 answers
Python sort list by custom function
Python
0 vote268 views1 answer
Python "urllib3" download and save pdf
Python
0 vote210 views1 answer
Py2exe no console
Python
0 vote207 views1 answer
Combine picture and audio python
Python
24 votes365 views1 answer
Python hour from date
Python
0 vote178 views1 answer
Customise django admin edit model button in field
Python
0 vote205 views1 answer
Python multithreading tutorials
Python
0 vote211 views1 answer
Discord py replace characters from string
Python
5 votes216 views2 answers
Python pie chart
Python
0 vote198 views1 answer
Python sum of array until index
Python