-
Notifications
You must be signed in to change notification settings - Fork 0
/
hashtable.c
153 lines (125 loc) · 2.82 KB
/
hashtable.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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdbool.h>
#define SIZE 20
struct DataItem
{
int data;
int key;
};
struct DataItem *hashArray[SIZE], *Item, *dummyItem;
int arraySize = 0;
int isFull()
{
return arraySize == SIZE;
}
int hashCode(int key)
{
return key % SIZE;
}
void insert(int key, int data)
{
if (!isFull())
{
Item = (struct DataItem *)malloc(sizeof(struct DataItem));
Item->data = data;
Item->key = key;
int hashIndex = hashCode(key);
while (hashArray[hashIndex] != NULL && hashArray[hashIndex]->key != -1)
{
hashIndex++;
hashIndex %= 20;
}
hashArray[hashIndex] = Item;
arraySize++;
}
else
{
printf("HashArray Is Full \n");
}
}
struct DataItem *search(int key)
{
int hashIndex = hashCode(key);
int count = 0; //if we do not use count then the loop will iterate infinitely in case of key is not found
while (hashArray[hashIndex] != NULL && count != SIZE)
{
if(hashArray[hashIndex]->key == key )
{
return hashArray[hashIndex];
}
hashIndex++;
hashIndex %= 20;
count++;
}
return NULL;
}
struct DataItem *delete(int key){
int hashIndex = hashCode(key);
int count = 0; //if we do not use count then the loop will iterate infinitely in case of key is not found
while (hashArray[hashIndex] != NULL && count != SIZE)
{
if(hashArray[hashIndex]->key == key )
{
Item = hashArray[hashIndex];
hashArray[hashIndex] = dummyItem;
return Item;
}
hashIndex++;
hashIndex %= 20;
count++;
}
return NULL;
}
void display(){
for(int i = 0 ; i < SIZE; i++)
{
if(hashArray[i] != NULL )
printf("Key: %d , Data: %d \n", hashArray[i]->key, hashArray[i]->data);
else
printf("-- \n");
}
}
int main()
{
dummyItem = (struct DataItem*) malloc(sizeof(struct DataItem));
dummyItem->data = -1;
dummyItem->key = -1;
insert(1, 10);
insert(2, 20);
insert(3, 30);
insert(4, 45);
insert(5, 54);
insert(6, 62);
insert(7, 71);
insert(8, 88);
insert(9, 97);
insert(10, 20);
insert(11, 70);
insert(12, 80);
insert(13, 25);
insert(14, 44);
insert(16, 32);
insert(15, 11);
insert(17, 78);
insert(18, 97);
insert(19, 11);
insert(20, 78);
insert(20, 78);
display();
Item = search(17);
if(Item != NULL)
{
printf("Element Found key:%d , data:%d \n", Item->key, Item->data);
}
else
printf("Element not found \n");
delete(17);
Item = search(17);
if(Item != NULL) {
printf("Element found: %d\n", Item->data);
} else {
printf("Element not found\n");
}
}