Easy Problemsoptimizationknapsack
Cutting a Rod
Given a rod of length n and a price list for pieces of every integer length up to n, cut the rod into pieces, or leave it whole, to maximize the total sale price of the resulting pieces.
Do this lesson first: coin changeThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.