/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

42 votes111 views5 answers
How to print today's date in python
Python
1 vote127 views1 answer
Python catch sigterm
Python
0 vote139 views1 answer
Drawing diff circles with random radius in diff positions .
Python
19 votes121 views2 answers
Python datetime string
Python
1 vote148 views1 answer
SystemError: tile cannot extend outside image
Python
6 votes120 views5 answers
Format in python
Python
0 vote125 views1 answer
Journalctl not showing all python prints
Python
0 vote132 views1 answer
How to update the kali linux os from python2 to python3
Python
0 vote122 views1 answer
Onehot encode list of columns pandas
Python
0 vote136 views1 answer
Pass in 2 numbers, A and B. You should create a list with A rows and B columns, then populate each cell
Python