A

Admin • 832.70K Points
Coach

Q. The worst-case efficiency of solving a problem in polynomial time is?

  • (A) o(p(n))
  • (B) o(p( n log n))
  • (C) o(p(n2))
  • (D) o(p(m log n))

Explanation by: Admin

the worst-case efficiency of solving an problem in polynomial time is o(p(n)) where p(n) is the polynomial time of input size.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.