(1) 假定每个记录有下列数据项：电话号码、用户名、地址。



(2) 一是从数据文件old.txt(自己现行建好)中读入各项记录，二是由系统随机产生各记录，并且把记录保存到new.txt文件中以及显示到屏幕上，记录条数不要少于30，然后分别以电话号码和用户名为关键字建立哈希表。



(3) 分别采用伪随机探测再散列法和再哈希法解决冲突。



(4) 查找并显示给定电话号码的记录；查找并显示给定用户名的记录。



(5) 将没有查找的结果保存到结果文件Out.txt中，显示查找结果前，要有提示语句。-(1) assumes that each record has the following data items: telephone number, user name, address. (2) First, from the data file old.txt (their current built) read into the record, the second is randomly generated by the system of records and the records to new.txt file and display to the screen, record Article number not less than 30, then each phone number and user name to build the hash table key. (3) were used to detect pseudo-random re-hashing and re-hash method to resolve the conflict. (4) to find and display a given number of records　find and show records of a given user name. (5) will not save the results to find the result file Out.txt, display the search results before, have prompted the statement.