Discussion Forum

  1. Home
  2. »
  3. Computer Science Mcqs
  4. »
  5. Data Structures Mcqs
  6. »
  7. Dynamic Programming Mcqs
  8. »
  9. Consider the brute force implementation...
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?

O(n^2)

O(n3)

O(nlogn)

O(2^n)

Answer: D . O(2^n)
0Shares
0 0

If you think the posted answer is wrong or Confused About the Answer? Ask for Details Here

Know Explanation? Add it Here
we’ll review your comment and contact you soon….

Leave a Reply

Your email address will not be published. Required fields are marked *

error: You are not allowed to do so.....
0Shares
0
Scroll to Top