forked from litwr2/research-of-sorting
-
Notifications
You must be signed in to change notification settings - Fork 0
/
shell-plain.cpp
54 lines (52 loc) · 1016 Bytes
/
shell-plain.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
template<class T> //Shell sort v1 (stepping by a value close to 3)
void shell_a3n(vector<T> &a) {
int i, j, h;
T v;
h = 1;
while (h < a.size())
h = 3*h + 1;
h = (h - 1)/3;
while (h) {
i = h;
j = i;
swap(v, a[i]);
for(;;) {
j -= h;
while (j >= 0 && v < a[j]) {
swap(a[j + h], a[j]);
j -= h;
}
swap(a[j + h], v);
if (++i == a.size()) break;
j = i;
swap(v, a[i]);
}
h = (h - 1)/3;
}
}
template<> //Shell sort v1 (stepping by a value close to 3)
void shell_a3n(vector<const char*> &a) {
int i, j, h;
const char *v;
h = 1;
while (h < a.size())
h = 3*h + 1;
h = (h - 1)/3;
while (h) {
i = h;
j = i;
v = a[i];
while (i < a.size()) {
j -= h;
while (j >= 0 && strcmp(v, a[j]) < 0) {
a[j + h] = a[j];
j -= h;
}
a[j + h] = v;
++i;
j = i;
v = a[i];
}
h = (h - 1)/3;
}
}