/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 vote186 views2 answers
Unable to import wx
Python
0 vote204 views1 answer
Pil saves blue images
Python
0 vote168 views1 answer
Python - How To Check if a String Is a Palindrome
Python
1 vote184 views1 answer
Python while false loop
Python
0 vote181 views2 answers
How to read mysql table in python
Python
0 vote228 views1 answer
Python coalesce
Python
0 vote188 views1 answer
Get a value using a dictionary key in python
Python
-1 vote191 views1 answer
How to remove an element from dictionary using his value python
Python
2 votes202 views1 answer
Get n random numbers from x to y python
Python
0 vote188 views1 answer
After groupby how to add values in two rows to a list
Python