/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

6 votes167 views2 answers
Dump json in file python
Python
1 vote182 views1 answer
How to smooth a function in python
Python
0 vote194 views1 answer
Streamlit change tab name
Python
1 vote192 views6 answers
Quick sort python
Python
3 votes178 views1 answer
Maping value to data in pandas dataframe
Python
0 vote215 views1 answer
Django queryset all objects
Python
5 votes172 views6 answers
Hello world python
Python
0 vote188 views2 answers
Convert outlook email to text file python
Python
2 votes180 views2 answers
How to check django rest framework version
Python Django
0 vote158 views1 answer
Django fixtures. To loaddata
Python