[理工] [資結]-Hashing
Which of the following is true?
A) Hashing technique enables to perform operations of search,insert and
delete in the same expected time
B) Hashing is an efficient technique in applications of both searching
and sorting.
C) Implementing stack using circular list enables efficent handling of
the "stack full" condition
D) The number of spanning trees of a graph with 7 nodes is 63
解答為C.....>"<
為何A錯阿～～～ 雜湊 search insert delete不是都是O(1)嗎ˊˋ
還有為什麼環狀的鏈結可以有效解決堆疊滿的問題，他的意思是說
比較容易偵測到stack何時為滿了嗎？
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 220.138.105.159
推
02/25 22:27, , 1F
02/25 22:27, 1F
推
02/25 22:29, , 2F
02/25 22:29, 2F
→
02/25 22:30, , 3F
02/25 22:30, 3F
推
02/25 22:38, , 4F
02/25 22:38, 4F
推
02/25 23:10, , 5F
02/25 23:10, 5F
推
02/25 23:59, , 6F
02/25 23:59, 6F
推
02/26 09:29, , 7F
02/26 09:29, 7F
→
02/26 09:30, , 8F
02/26 09:30, 8F
→
02/26 09:30, , 9F
02/26 09:30, 9F
→
02/26 09:31, , 10F
02/26 09:31, 10F
推
02/26 14:59, , 11F
02/26 14:59, 11F
推
03/01 16:45, , 12F
03/01 16:45, 12F
討論串 (同標題文章)
完整討論串 (本文為第 1 之 3 篇)：
理工
8
12