/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

2 votes266 views2 answers
Iterrows pd
Python
14 votes240 views3 answers
How to get id of user discord.py
Python
20 votes244 views5 answers
Join lists python
Python
0 vote259 views1 answer
Object to string pandas
Python
0 vote248 views1 answer
Converting double spaces int single spaces python
Python
0 vote280 views1 answer
Python inspect.getsource
Python
0 vote249 views1 answer
Beautifulsoup remove tag with class
Python
-1 vote250 views1 answer
Jupyternootebok matplotlib inline
Python
0 vote245 views1 answer
Get fields in object python
Python
87 votes250 views6 answers
Write dataframe to csv python
Python