数据结构实验：链地址法解决冲突构建散列表

#include "Assistance.h" #include "OpenHashTable.h" int main(void) { cout << "显示散列表：" << endl; //int elem[] = { 19, 14, 23, 1, 68, 20, 84, 27, 55, 11, 10, 79 }; int elem[] = { 22,76,53,49,88,2,36,75,45,42,25,29,20,38,41,43,70,73,66,63,64,69,100,121,136,532,786 }; OpenHashTable<int, int>ht(elem, 27, 27); //OpenHashTable<int, int>ht(elem, 12, 12); //ht.show(); return 0; }