Skip to content

Latest commit

 

History

History
6 lines (4 loc) · 384 Bytes

README.md

File metadata and controls

6 lines (4 loc) · 384 Bytes

Rod Cutting Problem

Given a rod of length N, and a price array P, such that p[i] is the cost of selling a rod of length i, find the maximum price for which the rod can be sold, by cutting it into an appropriate number of pieces

A graphical example of Rod Cutting Problem