Skip to content

Latest commit

 

History

History
 
 

rod_cutting

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 
 
 
 
 
 
 
 
 

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