Unformatted text preview: n 2 runs faster than an algorithm whose running time is 2 n on the same machine? Problems 1-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. 1 1 1 1 1 1 1 second minute hour day month year century lg n √ n n n lg n n 2 n 3 2 n n !...
View Full Document
This document was uploaded on 11/22/2010.
- Fall '09