ContextQMD
Back to Clrs

Problem

C01-The-Role-of-Algorithms-in-Computing/problem.md

latest2.3 KB
Original Source

Problems 1 : Comparison of running times

For each function f(n) and time t in the following table, determine the largest size n of a problem that can be solved in time t, assuming that the algorithm to solve the problem takes f(n) microseconds.

Answer

Item1 second1 miniute1 hour1 day1 month1 year1 century
62746280141713337805827551475137187085640479763389334968654697441062
10007745600002939381609968561569256175382
100391153244201373631593146677
19253136414451
9111213151617

Follow @louis1992 on github to help finish this task.