//散列表查找算法（Hash） 
#include <stdio.h>   
#include <stdlib.h>   
#define OK 1 
#define ERROR 0 
#define TRUE 1 
#define FALSE 0 
#define SUCCESS 1 
#define UNSUCCESS 0 
#define HASHSIZE 7          
#define NULLKEY -32768  
typedef int Status;   
typedef struct 
{ 
  int *elem;           //基址 
  int count;           //當(dāng)前數(shù)據(jù)元素個(gè)數(shù)  
}HashTable; 
 
int m=0; // 散列表表長 
 
/*初始化*/ 
Status Init(HashTable *hashTable) 
{ 
  int i; 
  m=HASHSIZE; 
  hashTable->elem = (int *)malloc(m * sizeof(int)); //申請(qǐng)內(nèi)存 
  hashTable->count=m; 
  for (i=0;i<m;i++) 
  { 
    hashTable->elem[i]=NULLKEY; 
  } 
  return OK; 
} 
 
/*哈希函數(shù)(除留余數(shù)法)*/ 
int Hash(int data) 
{ 
  return data % m; 
} 
 
/*插入*/ 
void Insert(HashTable *hashTable,int data) 
{ 
  int hashAddress=Hash(data); //求哈希地址 
 
  //發(fā)生沖突 
  while(hashTable->elem[hashAddress]!=NULLKEY) 
  { 
    //利用開放定址的線性探測(cè)法解決沖突 
    hashAddress=(++hashAddress)%m; 
  } 
 
  //插入值 
  hashTable->elem[hashAddress]=data; 
} 
 
/*查找*/ 
int Search(HashTable *hashTable,int data) 
{ 
  int hashAddress=Hash(data); //求哈希地址 
 
  //發(fā)生沖突 
  while(hashTable->elem[hashAddress]!=data) 
  { 
    //利用開放定址的線性探測(cè)法解決沖突 
    hashAddress=(++hashAddress)%m; 
 
    if (hashTable->elem[hashAddress]==NULLKEY||hashAddress==Hash(data)) return -1; 
  } 
 
  //查找成功 
  return hashAddress; 
} 
 
/*打印結(jié)果*/ 
void Display(HashTable *hashTable) 
{ 
  int i; 
  printf("\n//==============================//\n"); 
 
  for (i=0;i<hashTable->count;i++) 
  { 
    printf("%d ",hashTable->elem[i]); 
  } 
 
  printf("\n//==============================//\n"); 
} 
 
int main() 
{ 
  int i,j,result; 
  HashTable hashTable; 
  int arr[HASHSIZE]={13,29,27,28,26,30,38}; 
 
  printf("***************Hash哈希算法***************\n"); 
 
  //初始化哈希表 
  Init(&hashTable); 
 
  //插入數(shù)據(jù) 
  for (i=0;i<HASHSIZE;i++) 
  { 
    Insert(&hashTable,arr[i]); 
  } 
  Display(&hashTable); 
 
  //查找數(shù)據(jù) 
  result= Search(&hashTable,29); 
  if (result==-1)  
      printf("對(duì)不起，沒有找到！\n"); 
  else  
      printf("29在哈希表中的位置是:%d\n",result); 
  return 0; 
}