1145. Hashing – Average Search Time (25) – 甲级

原创

已于 2023-11-09 15:50:49 修改 · 5.2k 阅读

8 ·

CC 4.0 BY-SA版权

文章标签：

#哈希算法 #数据结构 #算法

于 2018-04-04 16:34:42 首次发布

The task of this problem is simple: insert a sequence of distinct positive integers into a hash table first. Then try to find another sequence of integer keys from the table and output the average search time (the number of comparisons made to find whether or not the key is in the table). The hash function is defined to be “H(key) = key % TSize” where TSize is the maximum size of the hash table. Quadratic probing (with positive increments only) is used to solve the collisions.
Note that the table size is better to be prime. If the maximum size given by the user is not prime, you must re-define the table size to be the smallest prime number which is larger than the size given by the user.
Input Specification:
Each input file contains one test case. For each case, the first line cont