[理工] 資結 tree
請問D選項正確答案應該是O(log(max(n_a,n_b)+1))嗎？
如果是的話想問O(logn)和O(log(n+1))不一樣嗎？
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 140.112.25.105
※ 文章網址: https://www.ptt.cc/bbs/Grad-ProbAsk/M.1479870100.A.38B.html
推
11/23 11:44, , 1F
11/23 11:44, 1F
→
11/23 11:44, , 2F
11/23 11:44, 2F
推
11/23 11:51, , 3F
11/23 11:51, 3F
→
11/23 12:06, , 4F
11/23 12:06, 4F
推
11/23 12:19, , 5F
11/23 12:19, 5F
→
11/23 12:20, , 6F
11/23 12:20, 6F
→
11/23 12:26, , 7F
11/23 12:26, 7F
推
11/23 12:26, , 8F
11/23 12:26, 8F
→
11/23 17:25, , 9F
11/23 17:25, 9F
→
11/23 23:58, , 10F
11/23 23:58, 10F
討論串 (同標題文章)
