散列查找.

#include <iostream>
#include <vector>
using namespace std;
#define NULLKEY -32768

class HashTable{
	private:
		int Hash(int key);
		vector<int> elem;
		int count;
		int m;
	public:
		HashTable(int n);
		void insertHash(int key);
		int searchHash(int key);
		void show();
};

HashTable::HashTable(int n): count(0), m(n) {
	for (int i = 0; i < n; i++) {
		elem.push_back(NULLKEY); 
	}
}

int HashTable::Hash(int key) {
	return key % m;
}

void HashTable::insertHash(int key) {
	int addr = Hash(key);
	while (elem[addr] != NULLKEY) {
		addr = (addr + 1) % m;
	}
	elem[addr] = key;
	count++;
}

int HashTable::searchHash(int key) {
	int addr = Hash(key);
	while (elem[addr] != key) {
		addr = (addr + 1) % m;
		if (elem[addr] == NULLKEY || addr == Hash(key)) {
			return -1;
		}
	}
	return addr;
}

void HashTable::show() {
	for (int i = 0; i < m; i++) {
		cout << elem[i] << " ";
	}
	cout << endl;
}
int main() {
	int n;
	vector<int> vec;
	cout << "输入数据元素个数" << endl;
	cin >> n;
	cout << "输入数据元素" << endl;
	int e;
	for (int i = 0; i < n; i++) {
		cin >> e;
		vec.push_back(e);
	} 
	HashTable H(n);
	for (int i = 0; i < n; i++) {
		H.insertHash(vec[i]);
	}
	cout << "散列表：" << endl;
	H.show();
	int val;
	cout << "输入要查找的数据元素：" << endl;
	while (~scanf("%d", &val)) {
		if (val == -1) break;
		e = H.searchHash(val);
		if (e == -1) {
			cout << "查找失败" << endl;
		}
		else {
			cout << "查找的数据元素在散列表中的位置下标：" << e << endl;
		}
	}
	return 0;
}