Description: 考虑具体问题的关键字集合，如{19，14，23，1，68，20，84，27，55，11，10，79}这样一组数据和给定的哈希表长m 或哈希表的装填因子a，选用除留余数法和线性探测再散列技术解决冲突所形成的哈希表-Keywords set to consider specific issues, such as (19,14,23,1,68,20,84,27,55,11,10,79) such a set of data and a given length m of the hash table or hash form filling factor a, I choose to stay except the number of law and the linear probing hashing technology to solve the conflict re-formation of the hash table Platform: |
Size: 1024 |
Author:lilin |
Hits:
Description: 1．定义哈希表数据结构。
2．除留余数法做为哈希函数、
H(key) = key P
用线性探测再散列解决冲突方法，编写函数，实现哈希造表的过程，并输出哈希表。
3．编写函数，求查找成功时的平均查找长度（ASL）。-1. Define hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key P re-hashing with linear probing methods of conflict resolution, write a function to achieve the hash table making process and output of the hash table. 3. Write function, seeking to find success, the average search length (ASL). Platform: |
Size: 1024 |
Author:Yvonne |
Hits:
Description: 为班级30个人的姓名设计一个哈希表，假设姓名用汉语拼音表示。要求用除留余数法构造哈希函数，用线性探测再散列法处理冲突，平均查找长度上限为2.-The names of 30 people for the class to design a hash table, assuming that the name in pinyin. Required to remain with the addition of more than a few method to construct hash functions, hashing by linear probing further conflict, the average search length limit to 2. Platform: |
Size: 14336 |
Author:sammie |
Hits:
Description: 哈希表的查找。用线性探测在散列的方法建立哈希表，然后对其中的元素进行查找-Hash table lookup. Hashing by linear probing method to establish the hash table, and then find the elements of which Platform: |
Size: 182272 |
Author:南风雅 |
Hits:
Description: 本程序可实现哈希表的建立，并用线性探测再散列的方法处理冲突-This procedure enables the establishment of the hash table and re-hashing with linear probing method of dealing with conflict Platform: |
Size: 2048 |
Author:侯志 |
Hits:
Description: 定义hash函数H=x N，假设用线性搜索来解决collision。算法实现的是根据hash table来重建输入序列。-reconstruct the input sequence according to the given hash table. The hashing function :H(x)=x N,and using linear probing to solve collisions. Platform: |
Size: 113664 |
Author:郭函数 |
Hits:
Description: 1．定义哈希表数据结构。
2．除留余数法做为哈希函数、
H(key) = key P
用线性探测再散列解决冲突方法，编写函数，实现哈希造表的过程，并输出哈希表。
3．编写函数，求查找成功时的平均查找长度（ASL）。-1. Define the hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key P re-hashing with linear probing method of conflict resolution, write functions, making the hash table implementation process, and output the hash table. 3. Write a function, seeking to find the average successful search length (ASL). Platform: |
Size: 1024 |
Author:finejade |
Hits:
Description: 1．定义哈希表数据结构。
2．除留余数法做为哈希函数、
H(key) = key P
用线性探测再散列解决冲突方法，编写函数，实现哈希造表的过程，并输出哈希表。
3．编写函数，求查找成功时的平均查找长度（ASL）。
-1. Define the hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key P re-hashing with linear probing methods of conflict resolution, write a function to achieve the hash table build process, and output the hash table. 3. Write function, seeking to find the average successful search length (ASL). Platform: |
Size: 157696 |
Author:武朝阳 |
Hits:
Description: 用除留余数法构造哈希表，用线性探测再散列的方法解决冲突-In addition to France to stay with the remainder constructed hash table, hashing with linear probing method of conflict resolution and then Platform: |
Size: 1024 |
Author:zhao |
Hits:
Search - linear probing hashing