假设人名为汉语拼音形式。待填入哈希表的人名共有30个，取平均查找长度的上限为2。哈希函数用除留余数法构造，用伪随机探测再散列法处理冲突。 测试数据：取本班同学姓名。-assumptions were called Chinese pinyin form. Hash Table question Enter the names of a total of 30, you take the average length of a maximum of two. Hash functions with

这是一个x^k检测产生的随机数的均匀性的程序，十分快速有效。-X ^ k which is a uniformity of the detection procedure to generate a random number, which is very quick and efficient.

简单的匹配游戏，运用泛型，随机数，每对图标检测运用时间限制。(Simple matching games, using generic, random number, each pair of icon detection, the use of time constraints.)