Q. Given a rod of length n and the selling prices of all pieces smaller than equal to n, find the most beneficial way of cutting the rod into smaller pieces. This problem is called the rod cutting problem. Which of these methods can be used to solve the rod cutting problem?
β
Correct Answer: (D)
brute force, dynamic programming and recursion
Explanation: brute force, dynamic programming and recursion can be used to solve the rod cutting problem.