-
Notifications
You must be signed in to change notification settings - Fork 0
/
BInaryHeap_Min.c
218 lines (178 loc) · 4.31 KB
/
BInaryHeap_Min.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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
#include <stdio.h>
#define MAX 10
typedef struct {
int heap[MAX];
int count;
} MaxHeap;
// INITIALIZE MAXHEAP
void init(MaxHeap *mxheap) {
int i;
for (i = 0; i < MAX; i++) {
mxheap->heap[i] = NULL;
}
mxheap->count = 0;
}
// RETURN PARENT INDEX
int parent(int index) {
return (index - 1) / 2;
}
// RETURN LEFT CHILD INDEX
int lchild(int index) {
return 2 * index + 1;
}
// RETURN RIGHT CHILD INDEX
int rchild(int index) {
return 2 * index + 2;
}
// SWAP TWO ELEMENTS IN MAXHEAP
void swap(MaxHeap *mxheap, int current, int parent) {
int temp;
temp = mxheap->heap[current];
mxheap->heap[current] = mxheap->heap[parent];
mxheap->heap[parent] = temp;
}
// INSERT ELEMENT IN MAXHEAP
void insert(MaxHeap *mxheap, int val) {
int i;
if(mxheap->count == MAX) {
printf("\nHeap is full");
return;
}
mxheap->count++;
i = mxheap->count - 1;
mxheap->heap[i] = val;
while(i != 0 && mxheap->heap[parent(i)] < mxheap->heap[i]) {
swap(mxheap, i, parent(i));
i = parent(i);
}
}
// DELETE MAX ELEMENT FROM MAXHEAP
void deleteMax(MaxHeap *mxheap) {
int i, child;
if (mxheap->count == 0) {
printf("\nHeap is empty");
return;
}
mxheap->heap[0] = mxheap->heap[mxheap->count - 1];
mxheap->count--;
i = 0;
while (lchild(i) < mxheap->count) {
child = lchild(i);
if (rchild(i) < mxheap->count && mxheap->heap[rchild(i)] > mxheap->heap[child]) {
child = rchild(i);
}
if (mxheap->heap[i] < mxheap->heap[child]) {
swap(mxheap, i, child);
i = child;
} else {
break;
}
}
}
// VISUALIZE MAXHEAP
void visualize(MaxHeap mxheap) {
int i;
for (i = 0; i < mxheap.count; i++) {
printf("%d ", mxheap.heap[i]);
}
}
// MAIN FUNCTION
int main() {
MaxHeap mxheap;
int choice, val;
init(&mxheap);
while (1) {
printf("\n1. Insert\n2. Delete Max\n3. Visualize\n4. Exit\n");
printf("Enter your choice: ");
scanf("%d", &choice);
switch (choice) {
case 1:
printf("Enter value: ");
scanf("%d", &val);
insert(&mxheap, val);
break;
case 2:
deleteMax(&mxheap);
break;
case 3:
visualize(mxheap);
break;
case 4:
exit(0);
break;
default:
printf("Wrong choice\n");
}
}
return 0;
}
// Closed Hashing, Insert
// Language: c
// Path: Practice 5.c
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
// Insert in closed hashing
void insert(char *str, int *hash, int size) {
int i, index;
for (i = 0; i < size; i++) {
index = hash[i] % size;
if (strcmp(str, hash[index]) == 0) {
return;
}
}
for (i = 0; i < size; i++) {
if (hash[i] == -1) {
hash[i] = atoi(str);
return;
}
}
}
// Search in closed hashing
int search(char *str, int *hash, int size) {
int i, index;
for (i = 0; i < size; i++) {
index = hash[i] % size;
if (strcmp(str, hash[index]) == 0) {
return 1;
}
}
return 0;
}
// Main for closed hashing
int main() {
int hash[10], size, choice, i;
char str[10];
printf("Enter size of hash table: ");
scanf("%d", &size);
for (i = 0; i < size; i++) {
hash[i] = -1;
}
while (1) {
printf("\n1. Insert\n2. Search\n3. Exit\n");
printf("Enter your choice: ");
scanf("%d", &choice);
switch (choice) {
case 1:
printf("Enter string: ");
scanf("%s", str);
insert(str, hash, size);
break;
case 2:
printf("Enter string: ");
scanf("%s", str);
if (search(str, hash, size)) {
printf("String found\n");
} else {
printf("String not found\n");
}
break;
case 3:
exit(0);
break;
default:
printf("Wrong choice\n");
}
}
return 0;
}