-
Notifications
You must be signed in to change notification settings - Fork 0
/
Hash.c
109 lines (91 loc) · 2.25 KB
/
Hash.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
/*************************************************************************
> File Name: Hash.cpp
> Author: yunting
> Mail:1368282581@qq.com
> Created Time: 2015年12月16日 星期三 13时44分04秒
************************************************************************/
#include <stdio.h>
#define HASHSIZE 11
typedef struct
{
int key;
int take_over;
}Datatype;
typedef struct
{
int data;
int time;
} Hashtable;
void Createht(Hashtable *ht, Datatype *L, int key_num) //ht为表,L中存关键字,
{
int i, times, a;
for (i = 0; i < HASHSIZE; i++) {
ht[i].data = -2;
ht[i].time = 0;
}
for (i = 0; i < key_num; i++) {
if ( ht[L[i].take_over].data == -2 ) {
ht[L[i].take_over].data = L[i].key;
ht[L[i].take_over].time = 1;
}
else {
times = 1;
a = L[i].take_over;
while (ht[a].data != -2) {
a++;
times++;
}
ht[a].data = L[i].key;
ht[a].time = times;
}
}
for (i = 0; i < key_num; i++) {
printf("%d-%d ",L[i].key, L[i].take_over );
}
printf ("\n\n");
for (i = 0 ; i < HASHSIZE; i++) {
printf ("%d-%d ", ht[i].data, ht[i].time);
}
}
int HashFunc (int key)
{
return key % HASHSIZE;
}
int Collision (int di)
{
return (di + 1) % HASHSIZE;
}
int HashSearch(Hashtable *ht, int key)
{
int address;
address = HashFunc(key);
while (ht[address].data != -2 && ht[address].data != key) {
address = Collision(address);
}
if (ht[address].data == key) {
return address;
} else {
return -1;
}
}
int main()
{
int key_num, i, find_key, key_add;
Datatype L[HASHSIZE];
Hashtable ht[HASHSIZE];
printf ("please input the number of all key : ");
scanf ("%d", &key_num);
getchar();
printf ("please input the all key : ");
for (i = 0; i < key_num; i++) {
scanf ("%d", &L[i].key);
L[i].take_over = L[i].key % HASHSIZE;
}
getchar();
Createht(ht, L, key_num);
printf ("please input the key you want to find : ");
scanf ("%d", &find_key);
key_add = HashSearch(ht, find_key);
printf("%d",key_add);
return 0;
}