問題詳情
19. Consider an empty hash table with 10 buckets and each bucket has 2 slots. Suppose that linear probing isused to handle overflow and the following is used as the hash function: h(n) =n % 10.Now we sequentially insert the following numbers into the hash table:5 15 23 44 3 53 6 4 109What is the summation of the numbers in the full buckets of the hash table?
(A) 153
(B) 150
(C) 262
(D) 43
(E) none of the above
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增