Dynamic programming algorithm: given a rod of length n inches and a table of prices "Pi", i=1,2,…,n, this algorithm finds the maximum revenue "Rn" obtainable by cutting up the rod and selling the pieces.
Geek Repo:Geek Repo
Github PK Tool:Github PK Tool