[理工] 計概
1. 找upper bound跟lower bound
T(n) = 2T(n/2) + n/log(n)
=> 這題好像沒辦法用master theorem
我有嘗試展開
T(n) = 2^log(n) + n/log(n) + n/log(n/2) + n/log(n/4) + ...
> 2^log(n) + n/log(n) + n/log(n) + n/log(n) + ...
= n + n/log(n)*log(n)
= 2n
Ω(T(n)) = n
T(n) = 2^log(n) + n/log(n) + n/log(n/2) + n/log(n/4) + ...
< 2^log(n) + n/log(n/(2)^log(n)) + n/log(n/(2)^log(n)) + ...
= n + n/log(n/(2)^log(n))*log(n)
= n
O(T(n)) = n
不知道我這樣寫對不對!?
2. please find the values in the list below that produce the sum 2200
191 691 573 337 365 730 651 493 177 354
=> 這題完全沒想法, 除了暴力法, 有其他方法嘛@@
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 118.168.192.250
推
02/08 22:54, , 1F
02/08 22:54, 1F
→
02/08 22:55, , 2F
02/08 22:55, 2F
→
02/08 22:56, , 3F
02/08 22:56, 3F
推
02/08 23:03, , 4F
02/08 23:03, 4F
→
02/08 23:04, , 5F
02/08 23:04, 5F
推
02/08 23:05, , 6F
02/08 23:05, 6F
→
02/08 23:21, , 7F
02/08 23:21, 7F
推
02/08 23:26, , 8F
02/08 23:26, 8F
推
02/08 23:34, , 9F
02/08 23:34, 9F
推
02/09 00:04, , 10F
02/09 00:04, 10F
推
02/09 00:07, , 11F
02/09 00:07, 11F
→
02/09 08:42, , 12F
02/09 08:42, 12F
→
09/11 14:54, , 13F
09/11 14:54, 13F
討論串 (同標題文章)
