..:: Complexity Classes on Data Structure and Algorithms related Questions and Answers

Complexity Classes on Data Structure and Algorithms related Questions and Answers

Question : The worst-case efficiency of solving a problem in polynomial time is?
1. O(p(n))
2. O(p( n log n))
3. O(p(n²))
4. O(p(m log n))
Answer : 1 - O(p(n))

* Be the First to Post a Comment.

Submit comment :

Ask Question

Note : Name and Email never shown.

Other Questions

Practice Paper sets

Complexity Classes on Data Structure and Algorithms related Questions and Answers

Submit comment :

Ask Question

JagSchool of Transformative Skills

PDPM Indian Institute of Information Technology Design Manufacturing

Global Institute Of Technology & Management

Institute for future education Entrepreneurship and leadership

Other Questions

Practice Paper sets

Complexity Classes on Data Structure and Algorithms related Questions and Answers

Submit comment :

Ask Question

Subscribe