Question: 1. Suppose we have an O(n^2) algorithm for a problem. Can we say: a. the problem is in P b. the problem is NP-complete c.
1. Suppose we have an O(n^2) algorithm for a problem. Can we say:
a. the problem is in P
b. the problem is NP-complete
c. neither a nor b
d. both a and b
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
