/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 vote158 views1 answer
Python launch ipython from script
Python
0 vote125 views2 answers
Remove empty lines from file python
Python
-1 vote137 views1 answer
Python type checking boolean
Python
2 votes135 views1 answer
IndentationError: unexpected indent
Python
0 vote130 views1 answer
Django template datetime-local
Python
1 vote122 views1 answer
Euclidean distance python 3 variables
Python
2 votes95 views2 answers
How to play audio in python
Python
0 vote168 views2 answers
Count items in a model django rest
Python
6 votes120 views2 answers
Multiple plot in one figure python
Python
-1 vote129 views1 answer
Figure vs plot matplotlib
Python