看书小记9（《C专家编程》）

哈希表简单实现，练个手

#include "stdafx.h"
#include <iostream>
using namespace std;


#define HASHSIZE 12


typedef struct HashTable
{
int *elem;
int count;
}HashTable;
int m = 0;


void Print(HashTable* h)
{
for (int i = 0; i < h->count; i++)
{
cout<<h->elem[i]<<" ";
}
cout<<endl;
}


void InitHashTable(HashTable* h)
{
m = HASHSIZE;
h->count = m;
h->elem = (int*)malloc(m*sizeof(int));
for (int i = 0; i < m; i++)
{
h->elem[i] = 0;
}
}


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


void Insert(HashTable* h, int key)
{
int addr = Hash(key);
while (h->elem[addr] != 0)
{
addr = (addr+1) % m;
}
h->elem[addr] = key;
}


bool Search(HashTable* h, int key)
{
int addr = Hash(key);
while (h->elem[addr] != key)
{
addr = (addr+1) % m;
if (h->elem[addr] == 0 || addr == Hash(key))
return false;
}
return true;
}


int _tmain(int argc, _TCHAR* argv[])
{
int arr[] = {12, 67, 56, 16, 25, 37, 22, 29, 15, 47, 48, 34};
HashTable* h = (HashTable*)malloc(sizeof(HashTable));
InitHashTable(h);
Print(h);
for (int i = 0; i < sizeof(arr)/sizeof(arr[0]); i++)
{
Insert(h, arr[i]);
}
Print(h);

cout<<Search(h, 22)<<endl;
cout<<Search(h, 23)<<endl;


int input;
cin>>input;

return 0;
}

看书小记9（《C专家编程》）,布布扣,bubuko.com

看书小记9（《C专家编程》）

原文：http://blog.csdn.net/pandawuwyj/article/details/26872859