/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 votes158 views1 answer
Shutdown/restart/hibernate/logoff windows with python
Python
6 votes208 views2 answers
Flask docker
Python Flask
4 votes149 views4 answers
Urllib python
Python
1 vote166 views2 answers
Why use python
Python
8 votes155 views1 answer
Python ubuntu check if a key is pressed
Python
0 vote181 views1 answer
Django app directory
Python Django
0 vote201 views1 answer
Server error 500 heroku django
Python
0 vote162 views1 answer
Create and add many to many field in django
Python
0 vote177 views1 answer
Malier module python
Python
8 votes152 views3 answers
Save plot in python
Python