[理工] [演算法] 關於big-O
以下皆為 True or False
--95 成大資工--
n^2 + nlogn + n/2 = O(n^8) ------> True
--94 交大資訊資結--
T(n) = 2T(n/2) + n^2 then T(n) = O(n^2logn) ------> False
這兩題讓我昏頭了
有沒有人能解釋一下這兩題的答案
為何一個是True 一個是False呢
P.S 我是看洪逸的資結題庫給的答案
------------------------------------------------
在加一題
--93 交大資料資結--
T(n) = 2T(n/2) + f(n) If f(n) = O(n^2), then T(n) = O(n^2logn) --> False
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.113.24.36
推
02/11 11:49, , 1F
02/11 11:49, 1F
→
02/11 11:51, , 2F
02/11 11:51, 2F
→
02/11 11:51, , 3F
02/11 11:51, 3F
推
02/11 11:52, , 4F
02/11 11:52, 4F
→
02/11 11:53, , 5F
02/11 11:53, 5F
※ 編輯: TheJim 來自: 140.113.24.36 (02/11 11:55)
→
02/11 12:05, , 6F
02/11 12:05, 6F
→
02/11 13:33, , 7F
02/11 13:33, 7F
→
02/11 13:33, , 8F
02/11 13:33, 8F
→
02/11 13:34, , 9F
02/11 13:34, 9F
→
02/11 13:35, , 10F
02/11 13:35, 10F
→
09/11 14:14, , 11F
09/11 14:14, 11F
討論串 (同標題文章)