-
Notifications
You must be signed in to change notification settings - Fork 0
/
Hash_2.cpp
102 lines (94 loc) · 1.42 KB
/
Hash_2.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
#include<iostream>
using namespace std;
class HASH
{
int * arr;
int size;
public:
HASH(int);
~HASH();
void insert(int);
int * Search(int);
void remove(int);
};
int main()
{
return 0;
}
HASH::HASH(int size)
{
this->size = size;
arr = new int[size];
for(int i = 0; i < size; i++)
{
*(arr + i) = -1;
}
}
HASH::~HASH()
{
delete [] arr;
size = 0;
}
void HASH::insert(int info)
{
int i = info;
i = i % size;
int j = i;
do
{
if(i == size)
i = 0;
if(*(arr + i) == -1)
{
*(arr + i) = info;
return;
}
i++;
}
while(i != j);
}
int * HASH::Search(int info)
{
int i = info;
i = i % size;
int j = i;
do
{
if(i == size)
i = 0;
if(*(arr + i) == info)
{
return (arr + i);
}
if(*(arr + i) == -1)
{
return NULL;
}
i++;
}
while (i != j);
return NULL;
}
void HASH::remove(int info)
{
int i = info;
i = i % size;
int j = i;
do
{
if(i == size)
i = 0;
if(*(arr + i) == info)
{
*(arr + i) = -1;
}
if(*(arr + i) == -1)
{
cout << "Nothing Found" << endl;
return;
}
i++;
}
while(i != j);
cout << "Nothing Found" << endl;
}