forked from NiharRanjan53/HacktoberFest_2022
-
Notifications
You must be signed in to change notification settings - Fork 0
/
hasing.cpp
274 lines (218 loc) · 5.06 KB
/
hasing.cpp
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
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
#include<iostream>
using namespace std;
void insert_withoutreplacement(int n)
{
int arr1[n-1];
int arr2[n-1];
int flag[n-1];
for(int i=0;i<n;i++)
{
flag[i]=0;
}
cout<<"Enter the elements "<<"\n";
for(int i=0;i<n;i++)
{
cin>>arr1[i];
}
for (int i=0;i<n;i++)
{
arr2[i]=-1;
}
//actual code
for(int i=0;i<n;i++)
{
int a=arr1[i]%n; //a=hash value
if(arr2[a]==-1)
{
arr2[a]=arr1[i];
flag[a]=1;
}
else
{
int c=a+1; //c is also hash key
int flag1=0;
while(c!=a && flag1==0)
{
if(flag[c]==0 && c<n)
{
arr2[c]=arr1[i];
flag[c]=1;
flag1=1;
break;
}
else
{
if(c==n)
{
c=-1;
}
}
c++;
}
}
}
cout<<" Hashing table is ";
cout<<"\n";
for(int j=0;j<n;j++)
{
cout<<arr2[j]<<" ";
}
}
void insert_replacement(int n)
{
int arr1[n-1];
int arr2[n-1];
int flag[n-1];
for(int i=0;i<n;i++)
{
flag[i]=0;
}
cout<<"Enter the elements "<<"\n";
for(int i=0;i<n;i++)
{
cin>>arr1[i];
}
for (int i=0;i<n;i++)
{
arr2[i]=-1;
}
for(int i=0;i<n;i++)
{
int a=arr1[i]%n;
if(arr2[a]==-1)
{
arr2[a]=arr1[i];
flag[a]=1;
}
else
{
int c=a+1;
int flag1=0;
while(c!=a && flag1==0)
{
if(flag[c]==0 && c<n)
{
arr2[c]=arr1[i];
flag[c]=1;
flag1=1;
//swappping
int temp;
temp=arr2[a];
arr2[a]=arr2[c];
arr2[c]=temp;
c++;
break;
}
else
{
if(c==n)
{
c=-1;
}
}
c++;
}
}
}
cout<<" Hashing table is ";
cout<<"\n";
for(int j=0;j<n;j++)
{
cout<<arr2[j]<<" ";
}
}
void insert_student(int n)
{
int arr1[n-1];
int arr2[n-1];
int flag[n-1];
for(int i=0;i<n;i++)
{
flag[i]=0;
}
cout<<"Enter the rollno of students "<<"\n";
for(int i=0;i<n;i++)
{
cin>>arr1[i];
}
for (int i=0;i<n;i++)
{
arr2[i]=-1;
}
//actual code
for(int i=0;i<n;i++)
{
int a=arr1[i]%n;
if(arr2[a]==-1)
{
arr2[a]=arr1[i];
flag[a]=1;
}
else
{
int c=a+1;
int flag1=0;
while(c!=a && flag1==0)
{
if(flag[c]==0 && c<n)
{
arr2[c]=arr1[i];
flag[c]=1;flag1=1;
break;
}
else
{
if(c==n)
{
c=-1;
}
}
c++;
}
}
}
cout<<" Roll No. Of students are ";
cout<<"\n";
for(int j=0;j<n;j++)
{
cout<<arr2[j]<<" ";
}
}
int main()
{
int choice=1,ch;
do
{
cout<<" Hashing "<<"\n";
cout<<"1.Linear probing without replacement"<<"\n";
cout<<"2.Linear probing with replacement"<<"\n";
cout<<"3.Hash Table to store the rollno of students "<<"\n";
cout<<"Enter your choice";
cin>>ch;
switch(ch)
{
case 1:
int n1;
cout<<"Enter the max length of hashing table: ";
cin>>n1;
insert_withoutreplacement(n1);
break;
case 2:
int n2;
cout<<"Enter the max length of hashing table: ";
cin>>n2;
insert_replacement(n2);
break;
case 3:
int n3;
cout<<"Enter the total no. of students in the class: "<<"\n";
cin>>n3;
insert_student(n3);
break;
}
cout<<"Press 1 to continue"<<"\n";
cin>>choice;
}
while(choice==1);
return 0;
}