/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

2 votes324 views1 answer
Max of matrix numpy
Python
0 vote322 views1 answer
ModuleNotFoundError: No module named 'readline'
Python
0 vote304 views1 answer
Dataframe time index convert tz naive to tz aware
Python
31 votes312 views6 answers
Try except python
Python
140 votes318 views6 answers
Python random integer in range
Python
4 votes328 views2 answers
Pandas replace values with only whitespace to null
Python
0 vote301 views1 answer
Randomly splits this DataFrame with the provided weights
Python
0 vote304 views1 answer
Python Print Variable Using the f-string in the print statement
Python
0 vote323 views1 answer
Pyfcm image
Python
0 vote347 views1 answer
Django Signup view
Python