forked from litwr2/research-of-sorting
-
Notifications
You must be signed in to change notification settings - Fork 0
/
array.cpp
215 lines (210 loc) · 7.14 KB
/
array.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
template<class T>
int array_index(const T &a, T minElem, double diff, unsigned c1) {
return (long double)(a - minElem)*c1/diff;
}
template<>
int array_index(const int64_t &a, int64_t minElem, double diff, unsigned c1) {
return (long double)(a - minElem)*c1/diff;
}
template<>
int array_index(const __int128 &a, __int128 minElem, double diff, unsigned c1) {
return (long double)(a - minElem)*c1/diff;
}
template<class T> void array_sort(vector<T> &a, const int f) {
T maxElem = a[0], minElem = a[0];
int i, j, l, k, m;
for (int i = 1; i < SS; ++i) {
if (maxElem < a[i]) maxElem = a[i];
if (minElem > a[i]) minElem = a[i];
}
if (maxElem == minElem) return;
unsigned c1 = f*SS - 1;
double c2 = maxElem - minElem;
if (c2 == 0) c2 = 1;
if (sizeof(T)*(f - 1) < (sizeof(int) - .125)*f) {
vector<T> auxArray(f*SS);
vector<bool> used(f*SS);
for (i = 0; i < SS; ++i) {
j = array_index(a[i], minElem, c2, c1);
if (!used[j])
auxArray[j] = a[i], used[j] = true;
else {
if (auxArray[j] > a[i]) {
while (j > 0)
if (used[j - 1] && auxArray[j - 1] > a[i])
--j;
else
break;
m = -1;
} else {
while (j + 1 < f*SS)
if (used[j + 1] && auxArray[j + 1] < a[i])
++j;
else
break;
m = 1;
}
k = 0;
for (;;) {
if (k + j >= 0 && k + j < f*SS && !used[k + j])
break;
if (k > 0) k = -k; else k = 1 - k;
}
l = j + k;
if (k > 0) k = 1; else k = -1;
j += (m + k)/2;
while (l != j) {
swap(auxArray[l], auxArray[l - k]);
used[l] = true;
l -= k;
}
auxArray[j] = a[i];
used[j] = true;
}
}
for (i = j = 0; i < SS; ++j)
if (used[j])
a[i++] = auxArray[j];
} else {
vector<int> auxArray(f*SS, -1);
for (i = 0; i < SS; ++i) {
j = array_index(a[i], minElem, c2, c1);
if (auxArray[j] < 0)
auxArray[j] = i;
else {
if (a[auxArray[j]] > a[i]) {
while (j > 0)
if (auxArray[j - 1] >= 0 && a[auxArray[j - 1]] > a[i])
--j;
else
break;
m = -1;
} else {
while (j + 1 < f*SS)
if (auxArray[j + 1] >= 0 && a[auxArray[j + 1]] < a[i])
++j;
else
break;
m = 1;
}
k = 0;
for (;;) {
if (k + j >= 0 && k + j < f*SS && auxArray[k + j] < 0)
break;
if (k > 0) k = -k; else k = 1 - k;
}
l = j + k;
if (k > 0) k = 1; else k = -1;
j += (m + k)/2;
while (l != j) {
auxArray[l] = auxArray[l - k];
l -= k;
}
auxArray[j] = i;
}
}
auto copy_of_a = a;
for (i = j = 0; i < SS; ++j)
if (auxArray[j] >= 0)
a[i++] = copy_of_a[auxArray[j]];
}
}
template<> void array_sort(vector<const char*> &a, const int f) {
const char *maxElem = a[0], *minElem = a[0];
int i, j, l, k, m;
for (int i = 1; i < SS; ++i) {
if (strcmp(maxElem, a[i]) < 0) maxElem = a[i];
if (strcmp(minElem, a[i]) > 0) minElem = a[i];
}
if (maxElem == minElem) return;
unsigned c1 = f*SS - 1;
auto c2 = convert(maxElem) - convert(minElem);
if (c2 == 0) c2 = 1;
if (sizeof(const char*)*(f - 1) < (sizeof(int) - .125)*f) {
vector<const char*> auxArray(f*SS);
vector<bool> used(f*SS);
for (i = 0; i < SS; ++i) {
j = (long double)(convert(a[i]) - convert(minElem))*c1/c2;
if (!used[j])
auxArray[j] = a[i], used[j] = true;
else {
if (strcmp(auxArray[j], a[i]) > 0) {
while (j > 0)
if (used[j - 1] && strcmp(auxArray[j - 1], a[i]) > 0)
--j;
else
break;
m = -1;
} else {
while (j + 1 < f*SS)
if (used[j + 1] && strcmp(auxArray[j + 1], a[i]) < 0)
++j;
else
break;
m = 1;
}
k = 0;
for (;;) {
if (k + j >= 0 && k + j < f*SS && !used[k + j])
break;
if (k > 0) k = -k; else k = 1 - k;
}
l = j + k;
if (k > 0) k = 1; else k = -1;
j += (m + k)/2;
while (l != j) {
swap(auxArray[l], auxArray[l - k]);
used[l] = true;
l -= k;
}
auxArray[j] = a[i];
used[j] = true;
}
}
for (i = j = 0; i < SS; ++j)
if (used[j])
a[i++] = auxArray[j];
} else {
vector<int> auxArray(f*SS, -1);
for (i = 0; i < SS; ++i) {
j = (long double)(convert(a[i]) - convert(minElem))*c1/c2;
if (auxArray[j] < 0)
auxArray[j] = i;
else {
if (strcmp(a[auxArray[j]], a[i]) > 0) {
while (j > 0)
if (auxArray[j - 1] >= 0 && strcmp(a[auxArray[j - 1]], a[i]) > 0)
--j;
else
break;
m = -1;
} else {
while (j + 1 < f*SS)
if (auxArray[j + 1] >= 0 && strcmp(a[auxArray[j + 1]], a[i]) < 0)
++j;
else
break;
m = 1;
}
k = 0;
for (;;) {
if (k + j >= 0 && k + j < f*SS && auxArray[k + j] < 0)
break;
if (k > 0) k = -k; else k = 1 - k;
}
l = j + k;
if (k > 0) k = 1; else k = -1;
j += (m + k)/2;
while (l != j) {
auxArray[l] = auxArray[l - k];
l -= k;
}
auxArray[j] = i;
}
}
auto copy_of_a = a;
for (i = j = 0; i < SS; ++j)
if (auxArray[j] >= 0)
a[i++] = copy_of_a[auxArray[j]];
}
}