/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 vote234 views1 answer
Xgboost feature importance
Python
0 vote225 views1 answer
Python import module from bitbucket
Python
8 votes245 views6 answers
Convert integer to binary python
Python
0 vote259 views1 answer
Tensorflow.keras.utils.to_categorical
Python
4 votes233 views5 answers
Python Fibonacci function
Python
11 votes229 views2 answers
Scikit learn linear regression
Python
0 vote276 views1 answer
Setting flask app environment variable
Python Flask
0 vote248 views3 answers
How to use group by in python to get 15 mins candle data from 1 min candle
Python
32 votes235 views6 answers
Else if python
Python
36 votes236 views1 answer
Sleep in py
Python