The worst-case efficiency of solving a problem in polynomial time is?
|B.||o(p( n log n))|
|D.||o(p(m log n))|
|Answer» A. o(p(n))|
|Explanation: 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.|
Login to Continue
It will take less than 2 minutes