Q. Consider the brute force implementation of the rod cutting problem in which all the possible cuts are found and the maximum value is calculated. What is the time complexity of this brute force implementation?
β
Correct Answer: (D)
o(2n)
Explanation: the brute force implementation finds all the possible cuts. this takes o(2n) time.