Question

assume an algorithm that takes Log²n microsecond to solve a problem and find the largest input size n such that the algorithm solves the problem in time 24 days

Answer 1

Answer:

Before solving the problem, we need to covert the time in terms of microsecond.

Here, the given time is 24 days, so 24 days into microseconds is calculated first.

1 Day into microseconds = 8.64e+10

Therefore, 24 days into microseconds = 24 × 8.64e+10

= 2.074e+12 microseconds

So,

log₂(n) = 2.074e+12 microseconds

In order to eliminate log₂ from the left side, we need to take 2^(x) on the right hand side of the equation.

Therefore,

n = 2^{2.074e+12}  

or, n = 2^(2000000000000)

So, the correct answer is 2^(2000000000000)