Breaking News: Grepper is joining You.com. Read the official announcement!

fibonacci dynamic programming with optimization

Defiant Donkey answered on February 16, 2022 Popularity 9/10 Helpfulness 1/10

answer fibonacci dynamic programming with optimization

fibonacci dynamic programming with optimization

Comment

def Fib(n):
	##Bottom up DP only storing the last two numbers
    a = 0
    b = 1
    if n == 0:
        return a
    elif n == 1:
        return b
    else:
        for i in range(2, n + 1):
            c = a + b
            a = b
            b = c
    return b

print(Fib(19))

Popularity 9/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: dynamic-programming fibonacci optimization whatever

Link to this answer
Share Copy Link