Vidyalelo
Data Structure · Q432

Miscellaneous on Data Structures

Programming · Data Structure · question 432

Q432

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

A.
O(p(n))
Answer
B.
O(p( n log n))
C.
O(p(n2))
D.
O(p(m log n))

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board