問題詳情
【題組】(24) The records with keys :13, 14, 2, 11, 18, 3, 36, 28 , 21 are inserted in sequential order into Hash Table using chaining method instead for collision resolution. What is the total number of identifier comparisons if each key value is searched once.
(A) 11
(B)13
(C)15
(D)17
(E) None of the above
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增