搜索资源列表
hashtable
- 用除留余数法构造哈希表,用线性探测再散列的方法解决冲突-In addition to France to stay with the remainder constructed hash table, hashing with linear probing method of conflict resolution and then
hash
- 线性探测再散列,解决哈希表冲突问题,仅供参考。-Linear detection of re-hash, hash table to resolve the conflict, for informational purposes only.
include1
- 1.利用实验建立一个有序表,采用折半查找实现某一已知的关键字的查找。 2.随机产生一组关键字,利用二叉排序树的插入算法建立二叉排序树,然后删除某一指定关键字元素。 3.已知散列函数H(key)=key p(p为自定义的常数),冲突处理方法分别为线性探测法、外拉链法实现 散列表的建立。 -find
6
- 考虑具体问题的关键字集合,如{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
hash
- 本程序可实现哈希表的建立,并用线性探测再散列的方法处理冲突-This procedure enables the establishment of the hash table and re-hashing with linear probing method of dealing with conflict
check
- 1.利用实验一建立的有序表,采用折半查找实现对某一已知的关键字的查找。 2.随机产生一组关键字,利用二叉排序树的插入算法建立二叉排序树,然后删除某一指定关键字元素。 3.已知散列函数为H(key)=key p(p为自定义的常数),冲突处理方法分别为线性探测法和外拉链法,建立散列表并实现查找某一指定关键字元素。-1. Experiment established orderly table, using a binary search to achieve a known keyword
hash
- 这是关于哈希查找的算法,采用线性探测再散列的方法处理冲突-This is about the hash lookup algorithm, using linear probing re-hash approach to conflict
Hash_Table
- 本例采取除留余数法构造哈希表; 采用线性探测再散列方法解决冲突,输出哈希表结果;考查了平均查找长度。-In addition to the cases taken to leaving the remainder construct a hash table using linear probing re-hash method to resolve conflicts, the output hash table results examined the average length.
hash
- 线性开型散列图形化描述Java开发-hash java
haxibiao
- 哈希表可以统计大的数据,例如全班同学的人名排列,如果遇到冲突,则采用线性探测法和随机散列再探测法-A hash table can count large data, such as names arranged in the class, and if you encounter a conflict, the linear detection method and random re-hash detection method
通讯录
- (1) 设每个记录有下列数据项:电话号码、用户名、地址; (2) 从键盘输入各记录,分别以电话号码为关键字建立散列表; (3) 采用线性探测再散列法解决冲突; (4) 查找并显示给定电话号码的记录; (5) 通讯录信息文件保存; (6) 要求人机界面友好,使用图形化界面;((1) set the following data items for each record: telephone number, username, and address; (2) input each r
哈希表查找的设计
- 设哈希表表长为20,用除留余数法构造一个哈希函数,以开放地址法中的线性探测再散列法作为解决冲突的方法,编程实现哈希表查找、插入和建立算法。(The set hash table length is 20. The algorithm of hash lookup, insert and build the hash table is programmed by using the exclusion residue method to construct a hash function and
Hasche
- 设定哈希函数 H(key) = key MOD 11 ( 表长=11 ),输入一组关键字序列,根据线性探测再散列解决冲突的方法建立哈希表的存储结构,显示哈希表,任意输入关键字,判断是否在哈希表中。(Set the hash function H (key) = key MOD 11 (table length =11), input a set of keyword sequences, set up the hash table storage structure based on the m