

McqMate
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)) |
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. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet