A)If you have the best solution for a rod of length x and you want to find the best solution for a rod of length x+1, how many values do you need to examine and what are they?

B)Assume the sorting algorithm that sorts in linear time.

Write the algorithm in pseudo code to find a fast algorithm that goes digit by digit an x digit binary number that has m values. (I.e., first the rightmost digit is put in sorted order, then the second rightmost,..., xth digit). Use a second array the same size, y.

What is the speed of your algorithm?

Answer rating: 100% (QA)

A When you want to find the best solution for a rod of length x1 you will need to examine x1 values ... View the full answer