## Computer Science: An Overview: Global Edition (12th Edition)

We could conclude only that the problem has complexity $\Theta\left(2^{n}\right)$ . If we could show that the “best algorithm” for solving the problem belongs to $\Theta\left(2^{n}\right)$ , we could conclude that the problem belongs to $\Theta\left(2^{n}\right)$ .
We could conclude only that the problem has complexity $\Theta\left(2^{n}\right)$ . If we could show that the “best algorithm” for solving the problem belongs to $\Theta\left(2^{n}\right)$ , we could conclude that the problem belongs to $\Theta\left(2^{n}\right)$ .