資料結構›Ch8 雜湊
第 31 題/共 37 題
◀ DS 31/37
31. Hash Table、Random Probing
#DS-08-031中Hash TableRandom Probing

Consider a hash table of size 7, with hash function H(k)=k%7H(k) = k \% 7, and pseudo random i=(i+5)%7i = (i + 5) \% 7. We want to insert the following keys one by one from left to right.

15, 11, 25, 16, 9, 8, 12

If random probing is used, which of the following statements are incorrect?

📄 中央113
跳轉到第題
▤完整推導請見《WH 資工筆記 · 資料結構》Ch8 雜湊
本章題號 · 21–37 / 37