作者supergud (小胖)
看板Grad-ProbAsk
标题Re: [理工] [资结]-hash table
时间Tue Jan 26 10:26:24 2010
※ 引述《cocaincola (☆★)》之铭言：
: Show your hash table, which contains 5 buckets and each bucket containing at
: most 3 records, after inserting 15,17, 26, 24, 11, 12, 9, 20, 8, 25, 30 if
: the hashing function is based on division and the overflow handling is linear
: open addressing. Calculate the average number of probes associated with your
: hash table.
: 拜托了 ><
┌────┐
0 │15 20 25│
├────┤
1 │26 11 30│
├────┤
2 │17 12 │
├────┤
3 │8 │
├────┤
4 │24 9 │
└────┘
我的浅见
不知道是不是正确的
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 203.72.64.202
1F：推 stdio:我也这样解 01/26 16:27
2F：推 qazwsxee:同样+1 01/26 19:50
3F：推 howar31:同解+1 03/01 16:49