哈希表

#include <stdio.h>
#define HASH_LEN 13　　//哈希表长度
#define TABLE_LEN 8　　//数据长度
int data[TABLE_LEN] = {69, 65, 90, 37, 92, 6, 20, 54};
int hash[HASH_LEN] = {0};    //initialize data is  0  初始化一个数组

//将数值插入hash表中
void InsertHash(int hash[], int m, int data)　　
{
        int i;
        i = data%13;    //get  hash address
        while(hash[i]){ // the address used；判断冲突
                i++;　　//解决冲突
                i = i % m;       
        }
        hash[i] = data;
}

void CreateHash(int hash[], int m, int data[], int n)
{       
        int i;
        for(i=0;i<n;i++) //place the data to hash map
        {         
              InsertHash(hash, n, data[i]);
        }
}

int HashSearch(int hash[], int n, int key)
{
        int i;
        i = key%13; //get the hash address;
        while(hash[i] &&hash[i]!=key) //is conflict?
        {
                i++;
                i=i% n; //resolve confict       
        }
        if(hash[i]==0)
                return  -1;     //not find the data
        else
                return i;       //find ok
}

int main()
{
        int key, i, pos;
        CreateHash(hash, HASH_LEN, data, TABLE_LEN);    
        printf("hash values: ");
        for(i=0;i<HASH_LEN;i++)
                printf("%d  ", hash[i]);
        printf("\n");
        printf("input the key data:");
        scanf("%d", &key);

        pos = HashSearch(hash, HASH_LEN, key);
        if(pos>=0)
                printf("find ok, pos is NO.%d \n", pos);
        else
                printf("find error\n");
        return 0;
}