推 cakeboy:可能可以H(X)-1%8 10/07 14:24
1.
Suppose we hashing with linear probing. There are 8 slots on our table
, indexed from 0 to 7. Initially all are empty. Then we insert 6 keys,
whose fash function value are , in order they are inserted , 2,4,2,4,2,4.
In whatlocation do we place the last key inserted? (Assume that , as usual
,we resolve collision by backing up in the table)
A)0 or 4 B) 1 or 5 C) 2 or 6 D) 3 or 7
^^^^^^^^^
我的解答
0 [ ]
1 [ ]
2 [2]
3 [2]
4 [4]
5 [4]
6 [2]
7 [4]<-
所以最後一個是7 但是3怎麼來的?
謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.116.243.66