/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 vote274 views1 answer
How to save a dictionary to excel in python
Python
0 vote246 views1 answer
Inverse mask python
Python
4 votes230 views2 answers
Amc
Python
0 vote242 views1 answer
How to make a plt plot for na image bigger
Python
4 votes237 views5 answers
Python code to print prime numbers
Python
-1 vote241 views1 answer
Significant figures on axes plot matplotlib
Python
0 vote164 views6 answers
Assign dictionary a value from a list python
Python
1 vote245 views1 answer
Python - count number of values without dupicalte in a second column values
Python
29 votes242 views5 answers
Python date and time
Python
0 vote223 views1 answer
Userregisterform
Python