Suppose a problem can be solved by an algorithm in ? (2n). What can we conclude about the complexity…

Need your ASSIGNMENT done? Use our paper writing service to score better and meet your deadline.


Order a Similar Paper HERE Order a Different Paper HERE

1. Suppose a problem can be solved by an algorithm in  θ (2n). What can we conclude about the complexity of the problem?

2. Suppose a problem can be solved by an algorithm in θ (n2) as well as another algorithm in  θ (2n). Will one algorithm always outperform the other?