[理工] [DS]binary search
True or False
(1)When there is duplication among primary keys, binary search can be used.
True.
(2)The time complexity of binary search is the same as searching with binary
search tree.
False.
------------------------------------------------------------------------------
我的疑問:
第一題,我不懂他到底在講甚麼,有沒有好心人可以幫我翻一下XD
第二題,不都一樣是Ο(㏒n)??...還是說連Worst Case 也要考慮進去??
以上...
有請高手幫忙解答....
鋼溫!!
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 223.139.214.182
推
11/06 00:05, , 1F
11/06 00:05, 1F
→
11/06 00:06, , 2F
11/06 00:06, 2F
※ 編輯: jim055006 來自: 223.139.214.182 (11/06 00:07)
推
11/06 00:07, , 3F
11/06 00:07, 3F
→
11/06 00:08, , 4F
11/06 00:08, 4F
→
11/06 00:08, , 5F
11/06 00:08, 5F
→
11/06 00:10, , 6F
11/06 00:10, 6F
推
11/06 00:11, , 7F
11/06 00:11, 7F
→
11/06 00:13, , 8F
11/06 00:13, 8F
推
11/06 00:17, , 9F
11/06 00:17, 9F
→
11/06 00:20, , 10F
11/06 00:20, 10F
→
09/11 14:35, , 11F
09/11 14:35, 11F