John D.

asked • 04/11/15

What is the Largest Input Size?

Suppose a machine on average takes 108 seconds to execute a single algorithm step. What is the largest input size for which the machine will execute the algorithm in 2 seconds assuming the number of steps of the algorithm is T(n) = log n

Anthony F.

The problem is to find the input of largest size that can be processed in two seconds given the running time T(n). Lets determine what can be processed in one second and determine the largest n such that log n ≤ 100000000. In this case, one second=100000000. To solve the inequality, rewrite the inequality as 2^logn ≤ 2^100000000 or n≤2^100000000...


1 Expert Answer


Still looking for help? Get the right answer, fast.

Ask a question for free

Get a free answer to a quick problem.
Most questions answered within 4 hours.


Find an Online Tutor Now

Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.