-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhash_table.cpp
More file actions
115 lines (106 loc) · 1.39 KB
/
hash_table.cpp
File metadata and controls
115 lines (106 loc) · 1.39 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
111
112
113
114
115
#include <iostream>
using namespace std;
struct hashh
{
int *dizi;
int boyut = 25;
int cnt;
};
int hesapla(hashh *anh,int x)
{
return x % anh->boyut;
}
hashh* tanimla()
{
hashh* h = new hashh;
h->dizi = new int[h->boyut];
int i = 0;
while (i < h->boyut)
{
h->dizi[i] = 0;
i++;
}
h->cnt = 0;
return h;
}
hashh* insert(hashh *h, int x)
{
if (h->cnt == h->boyut)
{
cout << "hash dolu";
}
else
{
int indis = hesapla(h, x);
while (h->dizi[indis] != 0 && h->dizi[indis] != -1)
{
indis++;
if (indis == h->boyut)
{
indis = 0;
}
}
h->dizi[indis] = x;
h->cnt++;
return h;
}
}
hashh * del(hashh* h, int x)
{
if (h->cnt == h->boyut)
{
cout << "hash dolu";
}
else
{
int indis = hesapla(h, x);
while (h->dizi[indis] != x && h->dizi[indis] == -1)
{
indis++;
if (indis == h->boyut)
{
indis = 0;
}
if (h->cnt == h->boyut)
{
break;
}
}
if (h->dizi[indis] == x)
{
h->dizi[indis] = -1;
}
else
{
cout << "aranan eleman yok";
}
return h;
}
}
void yazdir(hashh*h)
{
int i = 0;
while (i < h->boyut)
{
cout << i << ". indis " << h->dizi[i]<<endl;
i++;
}
system("pause");
}
int main()
{
hashh* h = tanimla();
yazdir(h);
h = insert(h, 25);
yazdir(h);
h = insert(h, 24);
yazdir(h);
h = insert(h, 24);
yazdir(h);
h = del(h, 25);
yazdir(h);
h = del(h, 24);
yazdir(h);
h = del(h, 24);
yazdir(h);
}