Cut Rod Problem
Bottom-Up Dynamic Programming — step-by-step live visualization
Rod Length
Speed
5×
▶ Play
⏭ Step
⏮ Back
↺ Reset
Rod Visualization
DP Table
0 / 0
Optimal Solution
Current Step
Press ▶ Play to begin…
Algorithm
def
bottom_up_cut_rod(p, n):
r = [
0
] * (n +
1
)
# r[0]=0
for
j
in
range(
1
, n+
1
):
q =
-∞
for
i
in
range(
1
, j+
1
):
q = max(q, p[i] + r[j-i])
r[j] = q
return
r[n]
Price Table (p[i])