Question: Consider an algorithm A with running time n n. Assume that A can solve instances of size n on a machine that takes 1012 seconds
Consider an algorithm A with running time n n. Assume that A can solve instances of size n on a machine that takes 1012 seconds per operation. What size instances (in terms of n) can A solve in the same time on a machine that takes 1015 seconds per operation?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
