C++在hash-chain.cpp文件，完成函数void SearchHT(HashTable ha[],int m,KeyType k) //在哈希表中查找关键字k。在主函数中通过键盘输入一组

题目：

在hash-chain.cpp文件，完成函数void SearchHT(HashTable ha[],int m,KeyType k)   //在哈希表中查找关键字k。在主函数中通过键盘输入一组数据。

（1）查询是否包括数据34；

（2）插入数据45。

（3）计算平均查找长度。

实现代码：

#include<iostream>
#include<cstdio>
#include<malloc.h>
#include<cstdlib>
#include<ctime>
#include"Linear_table.h"
#include"indexed_block.h"
using namespace std;

int binary_search_recursion(RecType R[], int low,int high, Keytype key) {
	int mid, ans;
	if (low > high && R[low].key == key)
		return high + 1;
	else if (low > high && R[low].key != key)
		return -1;
	else if (low <= high) {
		mid = (low + high) / 2;
		if (R[mid].key >= key)
			ans = binary_search_recursion(R, low, mid - 1, key);
		else
			ans = binary_search_recursion(R, mid + 1, high, key);
	}
	return ans;
}

int binary_search(RecType R[], int n, Keytype key) {	//二分有序查找非递归
	int low = 0, high = n - 1, mid;
	while (low <= high) {
		mid = (low + high) / 2;
		if (R[mid].key >= key)
			high = mid - 1;
		else
			low = mid + 1;
	}
	return high + 1;	//物理序号
}

int binary_block(IdxType I[], int b, RecType R[], int n, Keytype k)  {
	int s = (n + b - 1) / b;
	int low = 0, high = b - 1, mid, i;
	while (low <= high) {	//在索引表中二分查找
		mid = (low + high) / 2;
		if (R[mid].key >= k)
			high = mid - 1;
		else
			low = mid + 1;
	}
	i = I[high + 1].link;
	while (i <= I[high + 1].link + s - 1 && R[i].key != k) {
		++i;
	}
	if (i <= I[high + 1].link + s - 1)
		return i;	//返回物理序号
	else
		return 0;
}

int main() {
	RecType R[MaxSize];
	IdxType I[MaxSize];
	int n = 10, key = 8;
	int ans;
	for (int i = 0; i < n; ++i)
		R[i].key = i;
	ans = binary_search(R, 10, 8);
	cout << ans << endl;
	ans = binary_search_recursion(R, 0, 9, 8);
	cout << ans << endl;

	int a[25] = { 8,14,6,9,10,22,34,18,19,31,40,38,54,66,46,71,78,68,80,8,100,94,88,96,87 };
	n = 25, key = 31;
	for (int i = 0; i < n; ++i)
		R[i].key = a[i];
	int b[5] = { 14,34,66,85,100 };
	for (int i = 0; i < n; i += 5) {
		I[i].key = b[i];
		I[i].link = i;
	}
	int c = 5;
	ans = binary_block(I, c, R, n, key);
	cout << ans << endl;
}