Assume an algorithm that takes log n microseconds to solve a problem. Find the largest input size
Fantastic news! We've Found the answer you've been seeking!
Question:
Assume an algorithm that takes log² 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) 21400000
b) 21440000
c) 21444000
d) 21404040
Related Book For
Data Structures and Algorithms in Java
ISBN: 978-1118771334
6th edition
Authors: Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser
Posted Date: