/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 vote359 views1 answer
Cuantas palabras hay en una frase en python
Python
-2 votes364 views6 answers
Python List Comprehension
Python
1 vote350 views1 answer
Install imageio
Python
11 votes374 views2 answers
Import permutations
Python
5 votes322 views1 answer
Pandas save file to pickle
Python
3 votes341 views1 answer
Access the value in settings django
Python
0 vote329 views1 answer
Dynamic printing
Python
0 vote329 views1 answer
Python multiple items in with statment
Python
7 votes310 views1 answer
// meaning in python
Python
-1 vote376 views3 answers
Blockchain.py
Python