数据定义
#define NULLKEY -1
#define DELKEY -2
typedef struct {
KeyType key;
int count; //探测次数域
}HashTable;
插入
void InsertHT(HashTable ha[], int& n, int m, int p, KeyType k)
{
int i, adr;
adr = k % p; //计算
if (ha[adr].key == NULLKEY || ha[adr].key == DELKEY) //一次可放入
{
ha[adr].key = k;
ha[adr].count = 1;
}
else //冲突
{
i = 1; //计数寻找次数
do {
adr = (adr + 1) % m; //线性探测
i++;
} while (ha[adr].key != NULLKEY && ha[adr].key != DELKEY);
ha[adr].key = k;
ha[adr].count = i;
}
n++; //哈希表元素总个数
}
创建
void CreateHT(HashTable ha[], int& n, int m, int p, KeyType keys[], int n1)
{
for (int i = 0; i < m; i++) //初始化 m个空间
{
ha[i].key = NULLKEY;
ha[i].count = 0;
}
n = 0;
for (int i = 0; i < n1; i++) //keys中共 0~n1-1
{
InsertHT(ha, n, m, p, keys[i]);
}
}
删除
//删除
bool DeleteHT(HashTable ha[], int& n, int m, int p, KeyType k)
{
int adr;
adr = k % p;
while (ha[adr].key != NULLKEY && ha[adr].key != k) //是否一次找到
adr = (adr + 1) % m;
if (ha[adr].key == k)
{
ha[adr].key = DELKEY;
return true;
}
else
return false;
}
查找
//查找
void SearchHT(HashTable ha[], int m, int p, KeyType k)
{
int i = 1, adr;
adr = k % p;
while (ha[adr].key != NULLKEY && ha[adr].key != k)
{
i++;
adr = (adr + 1) % m;
}
if (ha[adr].key == k)
cout << "成功:关键字:" << k << ",比较" << i << "次" << endl;
else
cout << "失败:关键字:" << k << ",比较" << i << "次" << endl;
}
ASL计算
//ASL
void ASL(HashTable ha[], int n, int m, int p)
{
int i, j;
int succ = 0, unsucc = 0;
int s;
for (i = 0; i < m; i++)
if (ha[i].key != NULLKEY)
succ += ha[i].count;
cout << "成功ASL:" << n << "-" << succ * 1.0 / n;
for (i = 0; i < p; i++)
{
s = 1; j = i;
while (ha[j].key != NULLKEY)
{
s++;
j = (j + 1) % m;
}
unsucc += s;
}
cout << "不成功ASL" << n << "-" << unsucc * 1.0 / p;
}