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

1.	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» B. O(p( n log n))

Discussion