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.
Solution:
|
|
1
second
|
1
minute
|
1
hour |
1
day
|
1
month
|
1
year
|
1
century |
|
lg
n
|
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
n
|
 |
 |
 |
 |
 |
 |
 |
|
nlg
n
|
62746
|
2801417
|
133378058
|
2755147513
|
71870856404
|
797633893349
|
68654697441062
|
 |
1000
|
7745
|
60000
|
293938
|
1609968
|
5615692
|
56175382
|
 |
100
|
391
|
1532
|
4420
|
13736
|
31593
|
146677
|
 |
19
|
25
|
31
|
36
|
41
|
44
|
51
|
|
n!
|
9
|
11
|
12
|
13
|
15
|
16
|
17
|
No comments:
Post a Comment