[問題] 95中正資結(hashing問題)
題目原文如下：
If a hash function assigns 20 keys to random positions in a hash table
of size 500, about how likely is it that there will be no collisions？
我不懂的地方是 實在是想不出來用哪種hash function 可以創出一個不會碰撞
的情形？ 麻煩請各位先進指教一下，感謝。
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 123.192.82.138
→
03/26 22:39, , 1F
03/26 22:39, 1F
→
03/27 13:41, , 2F
03/27 13:41, 2F
→
03/27 13:42, , 3F
03/27 13:42, 3F
→
03/27 13:43, , 4F
03/27 13:43, 4F
推
04/19 14:33, , 5F
04/19 14:33, 5F