算法导论(第三版)参考答案:思考题1.1
Problem 1.1
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 takesf(n) microseconds.
(清楚各函数趋势)
| 1 second | 1 minute | 1 hour | 1 day | 1 month | 1 year | 1 century |
|---|---|---|---|---|---|---|
| lgn | 2106 | 26⋅107 | 236⋅108 | 2864⋅108 |

本文提供了算法导论第三版第一章中Problem 1.1的参考答案,详细解析了如何根据给定的时间t确定能用f(n)微秒解决的最大学习问题的规模n。
584

被折叠的 条评论
为什么被折叠?



