Consider a stick of length n units. Let m(n) be the minimum number of cuts required...

 

Transcribed Image Text:

Consider a stick of length n units. Let m(n) be the minimum number of cuts required to cut it into n pieces, if you are allowed stacking. That is, you are allowed to stack several stick pieces and cut them at the same time. This will be considered as a single cut. A stick 100 units long needs to be cut into 100 unit pieces. Find an expression for m(n). Also outline an algorithm that performs this task with the minimum number of cuts. Consider a stick of length n units. Let m(n) be the minimum number of cuts required to cut it into n pieces, if you are allowed stacking. That is, you are allowed to stack several stick pieces and cut them at the same time. This will be considered as a single cut. A stick 100 units long needs to be cut into 100 unit pieces. Find an expression for m(n). Also outline an algorithm that performs this task with the minimum number of cuts.