-
Notifications
You must be signed in to change notification settings - Fork 0
/
hash.c
68 lines (47 loc) · 1.17 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
#include <stdio.h>
#include <stdlib.h>
struct node{
char word[30];
struct node *next;
} *Node;
struct table{
int size;
struct node **tab;
} *HashTable;
Node createNode(char *word){
Node newnode = (Node)malloc(sizeof(struct node));
strcpy(newnode->string,word);
newnode->next=NULL
return newnode;
}
HashTable createHTable(int size){
HashTable newTable;
if (size < 1) return NULL
newTable = (HashTable)malloc(sizeof(struct table));
newTable->tab = (Node)malloc(sizeof(struct node)*size);
for(int i=0; i<size; i++) newTable->tab[i] = NULL;
newTable->size = size;
return newTable;
}
void insertToHash(HashTable ht, char* word){
int hashval = hashFunc(ht, word);
Node n = createNode(word);
strcpy(n->word,word);
n->next = ht->tab[hashval];
ht->tab[hashval] = n;
}
int searchInHash(HashTable ht, char* word){
int hashval = hashFunc(ht, word);
Node n = ht->tab[hashval];
while(n){
if(strcmp(n->word,word))
return 1;
n = n->next;
}
return 0;
}
int hashFunc(HashTable ht, char * word){
for()
hashval = ;
return hashval % hashtable->size;
}