A

Admin • 802.91K Points
Coach

Q. What is the time complexity of the brute force algorithm used to solve the assembly line scheduling problem?

  • (A) o(1)
  • (B) o(n)
  • (C) o(n2)
  • (D) o(2n)
Explanation by: Admin
in the brute force algorithm, all the possible ways are calculated which are of the order of 2n.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.