实验5+哈希表.doc

实验5哈希表PB13000818焦孟娇实验目的:。。。问题描述:查找是线性表的基本操作,各种查找算法的时空复杂度也是算法分析中的重要内容。本实验要求利用开放定址法和链地址法分别建立哈希表并进行查找、删除、增加关键字以及计算ASL的操作,以直观感受算法的时间复杂度与问题规模的关系。实验内容:(1)常量值、元素类型:#ESS1#ESS0#defineOK1#defineFALSE0#defineERROR0#defineDUPLICATE-1typedefstruct{int*elem;//定义存放关键字数组的首地址intcount;//定义关键字的个数intsizeindex;//定义哈希表的长度}HashTable1;//定义哈希表1(以线性探测法解决冲突)typedefstructnode{intdata;structnode*next;}Node;//定义结点类型typedefstruct{Node**elem;//定义存放关键字结点数组的首地址intcount;//定义关键字的个数intsizeindex;//定义哈希表的长度}HashTable2;//定义哈希表2(以拉链法解决冲突)typedefintStatus;inthashsize[168]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997};//存放1000以内素数的数组(2)函数算法分析:函数原型:intHash(intkey,intp)算法思想:返回key的哈希地址key%p。时间复杂度:O(1)。空间复杂度:O(1)。函数原型:StatusCreateHashTable1(HashTable1&h)算法思想:创建使用线性探测法解决冲突的哈希表h1,若碰到冲突,