/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 vote186 views1 answer
Bashrc rc meaning
Python
0 vote227 views1 answer
Fibonci in python
Python
0 vote201 views3 answers
Pip proxy settings
Python
1 vote204 views1 answer
Datetime not defined python
Python
0 vote197 views2 answers
Remove empty lines from file python
Python
23 votes199 views4 answers
Rename row pandas
Python
4 votes184 views2 answers
How to print a word in different line in python
Python
0 vote197 views1 answer
Python toupls
Python
0 vote221 views1 answer
Static instance and local variables in python
Python
0 vote189 views1 answer
Panda Python - Calculating what percentage of values are true and false out of total in boolean column
Python