文件名称:1
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
对记录序列（查找表）：{55，13，23，72，109，67，2，78,13}分别实现如下操作：
1) 顺序查找；
3) 对排好序的纪录序列表进行折半查找；
4) 利用1）中记录序列建立一颗二叉排序树，并在其上实现特定关键字值结点的查找；
5) 按照“除留余数法”哈希构造函数和线性探测再散列的冲突处理方法创建表长为m=11的哈希表；
6) 实现5）创建哈希表上的查找
-On the record sequence (lookup table): {} 55,13,23,72,109,67,2,78,13 were achieved as follows:
1) sequential search
3) sorted record sequence table binary search
4) Using 1) the establishment of a recorded sequence binary sort tree, and to achieve specific keywords to find the value of the node on which
5) Create a hash table of length m = 11 in accordance with the method of conflict management "in addition to leaving the remainder" linear probing hash constructor and re-hash
6) achieve 5) create a hash table lookup on
1) 顺序查找；
3) 对排好序的纪录序列表进行折半查找；
4) 利用1）中记录序列建立一颗二叉排序树，并在其上实现特定关键字值结点的查找；
5) 按照“除留余数法”哈希构造函数和线性探测再散列的冲突处理方法创建表长为m=11的哈希表；
6) 实现5）创建哈希表上的查找
-On the record sequence (lookup table): {} 55,13,23,72,109,67,2,78,13 were achieved as follows:
1) sequential search
3) sorted record sequence table binary search
4) Using 1) the establishment of a recorded sequence binary sort tree, and to achieve specific keywords to find the value of the node on which
5) Create a hash table of length m = 11 in accordance with the method of conflict management "in addition to leaving the remainder" linear probing hash constructor and re-hash
6) achieve 5) create a hash table lookup on
(系统自动生成,下载前可以参看下载内容)
下载文件列表
1\include.doc
1