/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

12 votes146 views3 answers
Python check if input is a number
Python
117 votes157 views6 answers
Python how to get user input
Python
1 vote143 views1 answer
How to join a string by new line out of a list python
Python
4 votes169 views2 answers
Difference between two dictionaries python
Python
0 vote161 views1 answer
Python code to remove file extension
Python
0 vote168 views1 answer
Custom_settings in scrpay
Python
4 votes162 views3 answers
Update python ubuntu
Python
1 vote155 views1 answer
Python list remove at index
Python
0 vote153 views1 answer
Using pypyodbc
Python
24 votes148 views2 answers
Python bs4 install
Python