資結DS 歷屆試題的幾個問題O(n)
1. For 2-3tree an individual rotation or combination operation take O(1) time
這題是交大某一年的,
不過在洪逸應用那本寫True,
在題庫那本寫False
2.
(A) log^k(n) = O(n) for any power k.
(B) f(n) be a linear function of n ,
f(n) = Ω log^k(n) for any power k.
(C) If k >= 1, then log^k(n) = O(n)
只有C是錯的,想問各位大這類的體型,怎麼判斷
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 180.217.7.244
※ 文章網址: https://www.ptt.cc/bbs/Grad-ProbAsk/M.1447686902.A.C1F.html
推
11/16 23:38, , 1F
11/16 23:38, 1F
→
11/16 23:41, , 2F
11/16 23:41, 2F
→
11/17 00:05, , 3F
11/17 00:05, 3F
推
11/17 00:11, , 4F
11/17 00:11, 4F
→
11/17 00:11, , 5F
11/17 00:11, 5F
推
11/17 00:59, , 6F
11/17 00:59, 6F
→
11/17 00:59, , 7F
11/17 00:59, 7F
→
11/17 00:59, , 8F
11/17 00:59, 8F
推
11/17 01:03, , 9F
11/17 01:03, 9F
推
11/17 01:05, , 10F
11/17 01:05, 10F
推
11/17 01:05, , 11F
11/17 01:05, 11F
→
11/17 01:05, , 12F
11/17 01:05, 12F
→
11/17 01:06, , 13F
11/17 01:06, 13F
→
11/17 01:09, , 14F
11/17 01:09, 14F
→
11/17 01:09, , 15F
11/17 01:09, 15F
推
11/17 01:09, , 16F
11/17 01:09, 16F
→
11/17 07:15, , 17F
11/17 07:15, 17F
→
11/17 09:34, , 18F
11/17 09:34, 18F
可是log(n!)=log(n^n)=nlogn,
log^2(n) > log(n^2)
所以理當(logn)^n應該大的些?
→
, , 19F
※ 編輯: wanedcol (180.217.6.163), 11/17/2015 10:12:36
推
11/17 23:05, , 20F
11/17 23:05, 20F
推
11/17 23:07, , 21F
11/17 23:07, 21F
→
11/17 23:07, , 22F
11/17 23:07, 22F
推
11/17 23:09, , 23F
11/17 23:09, 23F
推
11/17 23:19, , 24F
11/17 23:19, 24F
→
11/17 23:20, , 25F
11/17 23:20, 25F
推
11/17 23:27, , 26F
11/17 23:27, 26F
推
11/18 00:01, , 27F
11/18 00:01, 27F
推
11/18 00:11, , 28F
11/18 00:11, 28F
我覺得k沒說常數應該只是瑕疵,應該還是要作答,只是k=1跟any power應該是一樣的,
所以三個都對的機率會不會比較高?
※ 編輯: wanedcol (180.217.15.245), 11/18/2015 09:21:06
→
11/18 09:26, , 29F
11/18 09:26, 29F
推
11/18 11:07, , 30F
11/18 11:07, 30F