A

Admin • 802.91K Points
Coach

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?

  • (A) o(n2)
  • (B) o(n3)
  • (C) o(nlogn)
  • (D) o(2n)
Explanation by: Admin
the brute force implementation finds all the possible cuts. this takes o(2n) time.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.