Re: [理工] [資結]-hash table

看板Grad-ProbAsk作者 (小胖)時間14年前 (2010/01/26 10:26), 編輯推噓3(300)
留言3則, 3人參與, 最新討論串1/1
※ 引述《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

01/26 16:27, , 1F
我也這樣解
01/26 16:27, 1F

01/26 19:50, , 2F
同樣+1
01/26 19:50, 2F

03/01 16:49, , 3F
同解+1
03/01 16:49, 3F
文章代碼(AID): #1BNbBIOM (Grad-ProbAsk)