# Assume an algorithm that takes log 2 n microseconds to solve a problem. Find the largest input size n such

This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

## Question:

Assume an algorithm that takes log ^{2 }n microseconds to solve a problem.

Find the largest input size n such that the algorithm solves the problem in time in 24 days.

a) 2 ^{140000 }

b) 2 ^{1440000 }

c) 2 ^{1444000 }

d) 2 ^{1404040 }

**Related Book For**

## Ethical Obligations and Decision Making in Accounting Text and Cases

ISBN: 978-1259969461

5th edition

Authors: Steven M. Mintz, Roselyn E. Morris

**View Solution**

Create a free account to access the answer

**Cannot find your solution?**

Post a FREE question now and get an answer within minutes.
* Average response time.