/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 vote171 views1 answer
Truncatechars django
Python Django
78 votes136 views4 answers
Read json
Python
10 votes200 views2 answers
Set axis labels python
Python
0 vote141 views1 answer
Transform dictionary keys python
Python
0 vote141 views1 answer
Ascii to decimal python
Python
1 vote153 views1 answer
Python set timezone of datetime
Python
3 votes140 views1 answer
Make a window tkinter
Python
0 vote240 views1 answer
Scrape website with login python selenium
Python
0 vote135 views1 answer
How to convert array to vector in python
Python
9 votes135 views3 answers
A value is trying to be set on a copy of a slice from a DataFrame. Try using .loc[row_indexer,col_indexer] = value instead
Python