algorithms.tutorialhorizon.com
Dynamic Programming - Rod Cutting Problem | Algorithms
Given a rod of length n inches and a table of prices pi, i=1,2,…,n, write an algorithm to find the maximum revenue rn obtainable by cutting up the rod and selling the pieces.