/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

66 votes125 views4 answers
Iterate over rows dataframe
Python
0 vote104 views1 answer
Python program to assess if a file is closed or not
Python
20 votes103 views6 answers
Dict to list python
Python
0 vote104 views2 answers
Update a package with pip in django
Python
0 vote72 views1 answer
Flask put request
Python
28 votes100 views2 answers
Get a slice of string in python
Python
0 vote126 views1 answer
Form action in django
Python
0 vote141 views1 answer
Two input number sum in python
Python
2 votes150 views2 answers
TypeError: dict is not a sequence
Python
0 vote110 views1 answer
Name 'csv' is not defined
Python