针对某个集体中的人名设计一个哈希表，使得平均查找长度不超过R

假设待填入哈希表的人名有30个，平均查找长度为2。

哈希表用除留余数法构造，用伪随机探测在散列法处理冲突。

-For a group of names to design a hash table, making the average length of no more than R to find the assumption that hash table to be populated with the names of 30, the average search length is 2. Hash table with the exception of law to stay more than a few structures, pseudo-random detection by law to deal with conflict in the hash.