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))

💬 Discuss

✅ Correct 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.

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

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.

💬 Discussion

📊 Question Analytics

👁️

361

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

81%

Success Rate