/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 vote97 views1 answer
Python csv file tools
Python
0 vote124 views1 answer
How to get one record in django
Python Django
6 votes131 views1 answer
Pip freeze showing @ and not showing package version
Python
1 vote96 views1 answer
Get value from TextCtrl wxpython
Python
1 vote65 views1 answer
Create pyspark session with hive support
Python
4 votes104 views2 answers
Loginrequiredmixin
Python
4 votes98 views1 answer
Iterating over 2d array python
Python
1 vote97 views3 answers
Py random list integers
Python
13 votes114 views5 answers
Binary tree in python
Python
14 votes102 views6 answers
Permutations in python
Python