/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

5 votes174 views2 answers
Put comma in numbers python
Python
2 votes196 views3 answers
Python find first occurrence in list
Python
0 vote181 views1 answer
Seaborn define linewidth
Python
11 votes176 views3 answers
Get yesterday date python
Python
1 vote209 views1 answer
How to get continuous mouse position with pyautogui in python
Python
0 vote201 views1 answer
ModuleNotFoundError: No module named 'django.db.models.enums'
Python Django
0 vote181 views1 answer
How to read panda column
Python
5 votes179 views5 answers
Pandas shape
Python
0 vote169 views1 answer
Django db_index=true
Python
0 vote222 views3 answers
How to print tables using python
Python