/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

15 votes116 views2 answers
Insert string into middle of list python
Python
14 votes98 views3 answers
Terminal python version
Python
0 vote209 views1 answer
Flask app with spark
Python
0 vote111 views1 answer
Python on_mouse_down/collidepoint
Python
7 votes116 views1 answer
Replace cell pandas
Python
0 vote117 views1 answer
Python variable definieren
Python
1 vote151 views3 answers
Pdf to string python
Python
0 vote126 views1 answer
Test if instance in queryset django
Python
0 vote113 views1 answer
Shuffle the data before GridSearchCV
Python
1 vote118 views2 answers
How to swap two variables without using third variable python
Python