資料結構›Ch8 雜湊第 28 題/共 37 題
28. Hash Table、Linear Probing
#DS-08-028易Hash TableLinear Probing
[4%] The following is a hash table with linear probing. Assume the hash function is for indexing the hash table. Data items 23, 52, 11, 1, 50, 99, 65, 20, 35, 34 and 82 are inserted into the hash table in order. Please fill the five blanks in the table.
| key | value |
|---|---|
| 0 | 34 |
| 1 | (A) ? |
| 2 | (B) ? |
| 3 | (C) ? |
| 4 | (D) ? |
| 5 | (E) ? |
| 6 | 23 |
| 7 | |
| 8 | |
| 9 | |
| 10 | |
| 11 | 11 |
| 12 | |
| 13 | |
| 14 | 99 |
| 15 | 65 |
| 16 | 50 |
📄 成大111
▤完整推導請見《WH 資工筆記 · 資料結構》Ch8 雜湊