Suppose a computer can solve a problem of size 100,000 in 15 hours.
Assume that execution time is determined by CPU speed; i.e., no other
constraint on performance.
How large a problem can be solved in 15 hours by a computer that is 100
times faster if the program's time complexity is
1. θ(n) 2. θ(n log n)
3. θ(n^2) 4. θ(n^3)
以前沒遇過這種題目, 不知如何把實際計算時間跟複雜度兜在一起
希望高手解答
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 111.240.190.119