#include <string.h>
#include <stdlib.h>
const int HASH_TABLE_SIZE = 13
typedef struct hash_table_pair_s {
char *key
int value
struct hash_table_pair_s *next
} hash_table_pair_t
int ELFhash(const char *key)
{
unsigned long h = 0
unsigned long g
while( *key )
{
h =( h<<4) + *key++
g = h &0xf0000000L
if( g ) h ^= g >>24
h &= ~g
}
return h
}
void hash_table_insert(hash_table_pair_t *hash_table, const char *key, int value)
{
int pos
hash_table_pair_t *new_pair
char *new_str
pos = ELFhash(key) % HASH_TABLE_SIZE
if (hash_table[pos].key != NULL) {
printf("conflict: %s and %s\n", key, hash_table[pos].key)
new_pair = (hash_table_pair_t *)malloc(sizeof(hash_table_pair_t))
new_str = (char *)malloc(sizeof(char) * (strlen(key) + 1))
strcpy(new_str, key)
new_pair->key = new_str
new_pair->value = value
new_pair->next = hash_table[pos].next
hash_table[pos].next = new_pair
}
else {
new_str = (char *)malloc(sizeof(char) * (strlen(key) + 1))
strcpy(new_str, key)
hash_table[pos].key = new_str
hash_table[pos].value = value
hash_table[pos].next = NULL
}
}
int hash_table_get(hash_table_pair_t *hash_table, const char *key, int *value)
{
int pos
hash_table_pair_t *p
pos = ELFhash(key) % HASH_TABLE_SIZE
for (p = &hash_table[pos]p != NULLp = p->next) {
if (!strcmp(p->key, key)) {
*value = p->value
return 0
}
}
return -1
}
int main()
{
int i, status, value
const char *MyBirds[13] = { "robin", "sparrow", "hawk", "eagle", "seagull", "bluejay", "owl", "cardinal", "Jakana", "Moa", "Egret", "Penguin", "hawk" }
hash_table_pair_t *hash_table = (hash_table_pair_t *)malloc(HASH_TABLE_SIZE * sizeof(hash_table_pair_t))
for (i = 0i <HASH_TABLE_SIZEi++) {
hash_table[i].key = NULL
hash_table[i].next = NULL
hash_table[i].value = 0
}
for (i = 0i <sizeof(MyBirds) / sizeof(MyBirds[0])i++) {
hash_table_insert(hash_table, MyBirds[i], i)
}
for (i = 0i <sizeof(MyBirds) / sizeof(MyBirds[0])i++) {
status = hash_table_get(hash_table, MyBirds[i], &value)
if (status == -1) {
printf("not found %s\n", MyBirds[i])
}
else {
printf("found %s: %d\n", MyBirds[i], value)
}
}
return 0
}
//来源http://hi.baidu.com/xiaojiang/item/6a0a4d14430509f4dceecae5#include <stdio.h>
#include <stdlib.h>
//定义哈希函数 num :需要进行散列的数据
/*author 码农小江*/
int hashFunc( int num)
{
int hashValue
hashValue = num%7
return hashValue
}
void main()
{
int i, j,k, hash_value, second_hash
static int hashTable[7]//定义长度是7的散列表
int a[6] = {38,25,74,63,52,48}//线性表
for(i=0i<6i++)
{
hash_value = hashFunc(a[i])//计算每个元素的散列值
if(!hashTable[hash_value])//若没有冲突，即当前第一次占用则成功
{
hashTable[hash_value] = a[i]
}else//否则重新计算，到没有冲突为止
{
for(j=1j<6j++)
{
second_hash = (hash_value + j)%7
if(!hashTable[second_hash])
{
hashTable[second_hash] = a[i]
break
}
}
}
}
for(k=0k<7k++)
{
printf("%d\n", hashTable[k])
}
}
