/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 vote218 views1 answer
Python break out of function
Python
17 votes244 views4 answers
How to check how many items are in a list python
Python
0 vote169 views1 answer
Django time cualtulate
Python
0 vote222 views1 answer
Arch linux python 3.7
Python
0 vote200 views6 answers
Python3 vowels and consonants filter
Python
0 vote213 views1 answer
Python transform two columns to a list combine
Python
1 vote221 views1 answer
Write a Python program to read last n lines of a file
Python
0 vote164 views2 answers
Python union type
Python
0 vote210 views1 answer
Python opens windows store
Python
3 votes201 views1 answer
How to make it so the pygame window will close
Python