-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhashLinearProbing.cpp
More file actions
110 lines (106 loc) · 2.24 KB
/
Copy pathhashLinearProbing.cpp
File metadata and controls
110 lines (106 loc) · 2.24 KB
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
#include <iostream>
using namespace std;
const int arrsize = 10;
int hashTable[arrsize];
void insert(int value){
int i=1;
int index = value % arrsize;
while (index != arrsize)
{
if (hashTable[index] == -1)
{
hashTable[index] = value;
return;
}
index += i;
i++;
if (index == arrsize)
{
index = 0;
}
if (i == index)
{
cout<<"\nspace not availble ";
return;
}
}
}
void search(int value){
int i = 1;
bool flag = false;
int index = value % arrsize;
if (hashTable[index] == value)
{
flag = true;
cout<<"value found at index: "<<index<<endl;
}
else{
while (index != arrsize)
{
index += i;
i++;
if (index == arrsize)
{
index = 0;
}
if (hashTable[index] == value)
{
cout<<"value found at index: "<<index<<endl;
flag = true;
return;
}
}
if (flag == false)
{
cout<<"Value not found "<<endl;
}
}
}
void display(){
for (size_t i = 0; i < arrsize; i++)
{
cout<<hashTable[i]<<" ";
}
}
int main(int argc, char const *argv[])
{
for (size_t i = 0; i < arrsize; i++)
{
hashTable[i] = -1;
}
int choice,value;
while(true){
cout<<"1: Insert"<<endl;
cout<<"2: Search"<<endl;
cout<<"3: View Elements"<<endl;
cout<<"4: Exit"<<endl;
cout<<"Enter which operation would you like to perform : "<<endl;
cin>>choice;
switch (choice)
{
case 1:
cout<<"Enter value to be inserted: ";
cin>>value;
insert(value);
break;
case 2:
cout<<"Enter value to search:";
cin>>value;
search(value);
break;
case 3:
display();
break;
case 4:
cout<<"Exiting...\n";
break;
default:
break;
}
if (choice >= 4)
{
break;
}
}
return 0;
}