資料結構›Ch8 雜湊第 19 題／共 37 題
19. Hash Table、Chaining
#DS-08-019易Hash TableChaining
- Assume we use chaining to handle collision in hash table T, which has 5 slots and uses the hash function h(k)= k mod 5. (i.e., k is placed at T[h(k)]). If we insert 7, 1, 10, 12, 2, 55, and 5 to the hash table, which of the table slot will have more than two keys?
📄 交大111
▤完整推導請見《WH 資工筆記 · 資料結構》Ch8 雜湊