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
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
|
/* Stable-sorting of an array using mergesort.
Copyright (C) 2009-2024 Free Software Foundation, Inc.
Written by Bruno Haible <bruno@clisp.org>, 2009.
This file is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as
published by the Free Software Foundation; either version 2.1 of the
License, or (at your option) any later version.
This file is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>. */
/* This file implements stable sorting of an array, using the mergesort
algorithm.
Worst-case running time for an array of length N is O(N log N).
Unlike the mpsort module, the algorithm here attempts to minimize not
only the number of comparisons, but also the number of copying operations.
Before including this file, you need to define
ELEMENT The type of every array element.
COMPARE A two-argument macro that takes two 'const ELEMENT *'
pointers and returns a negative, zero, or positive 'int'
value if the element pointed to by the first argument is,
respectively, less, equal, or greater than the element
pointed to by the second argument.
STATIC The storage class of the functions being defined.
STATIC_FROMTO (Optional.) Overrides STATIC for the 'merge_sort_fromto'
function.
Before including this file, you also need to include:
#include <stddef.h>
*/
/* Merge the sorted arrays src1[0..n1-1] and src2[0..n2-1] into
dst[0..n1+n2-1]. In case of ambiguity, put the elements of src1
before the elements of src2.
n1 and n2 must be > 0.
The arrays src1 and src2 must not overlap the dst array, except that
src1 may be dst[n2..n1+n2-1], or src2 may be dst[n1..n1+n2-1]. */
static void
merge (const ELEMENT *src1, size_t n1,
const ELEMENT *src2, size_t n2,
ELEMENT *dst)
{
for (;;) /* while (n1 > 0 && n2 > 0) */
{
if (COMPARE (src1, src2) <= 0)
{
*dst++ = *src1++;
n1--;
if (n1 == 0)
break;
}
else
{
*dst++ = *src2++;
n2--;
if (n2 == 0)
break;
}
}
/* Here n1 == 0 || n2 == 0 but also n1 > 0 || n2 > 0. */
if (n1 > 0)
{
if (dst != src1)
do
{
*dst++ = *src1++;
n1--;
}
while (n1 > 0);
}
else /* n2 > 0 */
{
if (dst != src2)
do
{
*dst++ = *src2++;
n2--;
}
while (n2 > 0);
}
}
/* Sort src[0..n-1] into dst[0..n-1], using tmp[0..n/2-1] as temporary
(scratch) storage.
The arrays src, dst, tmp must not overlap. */
#ifdef STATIC_FROMTO
STATIC_FROMTO
#else
STATIC
#endif
void
merge_sort_fromto (const ELEMENT *src, ELEMENT *dst, size_t n, ELEMENT *tmp)
{
switch (n)
{
case 0:
return;
case 1:
/* Nothing to do. */
dst[0] = src[0];
return;
case 2:
/* Trivial case. */
if (COMPARE (&src[0], &src[1]) <= 0)
{
/* src[0] <= src[1] */
dst[0] = src[0];
dst[1] = src[1];
}
else
{
dst[0] = src[1];
dst[1] = src[0];
}
break;
case 3:
/* Simple case. */
if (COMPARE (&src[0], &src[1]) <= 0)
{
if (COMPARE (&src[1], &src[2]) <= 0)
{
/* src[0] <= src[1] <= src[2] */
dst[0] = src[0];
dst[1] = src[1];
dst[2] = src[2];
}
else if (COMPARE (&src[0], &src[2]) <= 0)
{
/* src[0] <= src[2] < src[1] */
dst[0] = src[0];
dst[1] = src[2];
dst[2] = src[1];
}
else
{
/* src[2] < src[0] <= src[1] */
dst[0] = src[2];
dst[1] = src[0];
dst[2] = src[1];
}
}
else
{
if (COMPARE (&src[0], &src[2]) <= 0)
{
/* src[1] < src[0] <= src[2] */
dst[0] = src[1];
dst[1] = src[0];
dst[2] = src[2];
}
else if (COMPARE (&src[1], &src[2]) <= 0)
{
/* src[1] <= src[2] < src[0] */
dst[0] = src[1];
dst[1] = src[2];
dst[2] = src[0];
}
else
{
/* src[2] < src[1] < src[0] */
dst[0] = src[2];
dst[1] = src[1];
dst[2] = src[0];
}
}
break;
default:
{
size_t n1 = n / 2;
size_t n2 = (n + 1) / 2;
/* Note: n1 + n2 = n, n1 <= n2. */
/* Sort src[n1..n-1] into dst[n1..n-1], scratching tmp[0..n2/2-1]. */
merge_sort_fromto (src + n1, dst + n1, n2, tmp);
/* Sort src[0..n1-1] into tmp[0..n1-1], scratching dst[0..n1-1]. */
merge_sort_fromto (src, tmp, n1, dst);
/* Merge the two half results. */
merge (tmp, n1, dst + n1, n2, dst);
}
break;
}
}
/* Sort src[0..n-1], using tmp[0..n-1] as temporary (scratch) storage.
The arrays src, tmp must not overlap. */
STATIC void
merge_sort_inplace (ELEMENT *src, size_t n, ELEMENT *tmp)
{
switch (n)
{
case 0:
case 1:
/* Nothing to do. */
return;
case 2:
/* Trivial case. */
if (COMPARE (&src[0], &src[1]) <= 0)
{
/* src[0] <= src[1] */
}
else
{
ELEMENT t = src[0];
src[0] = src[1];
src[1] = t;
}
break;
case 3:
/* Simple case. */
if (COMPARE (&src[0], &src[1]) <= 0)
{
if (COMPARE (&src[1], &src[2]) <= 0)
{
/* src[0] <= src[1] <= src[2] */
}
else if (COMPARE (&src[0], &src[2]) <= 0)
{
/* src[0] <= src[2] < src[1] */
ELEMENT t = src[1];
src[1] = src[2];
src[2] = t;
}
else
{
/* src[2] < src[0] <= src[1] */
ELEMENT t = src[0];
src[0] = src[2];
src[2] = src[1];
src[1] = t;
}
}
else
{
if (COMPARE (&src[0], &src[2]) <= 0)
{
/* src[1] < src[0] <= src[2] */
ELEMENT t = src[0];
src[0] = src[1];
src[1] = t;
}
else if (COMPARE (&src[1], &src[2]) <= 0)
{
/* src[1] <= src[2] < src[0] */
ELEMENT t = src[0];
src[0] = src[1];
src[1] = src[2];
src[2] = t;
}
else
{
/* src[2] < src[1] < src[0] */
ELEMENT t = src[0];
src[0] = src[2];
src[2] = t;
}
}
break;
default:
{
size_t n1 = n / 2;
size_t n2 = (n + 1) / 2;
/* Note: n1 + n2 = n, n1 <= n2. */
/* Sort src[n1..n-1], scratching tmp[0..n2-1]. */
merge_sort_inplace (src + n1, n2, tmp);
/* Sort src[0..n1-1] into tmp[0..n1-1], scratching tmp[n1..2*n1-1]. */
merge_sort_fromto (src, tmp, n1, tmp + n1);
/* Merge the two half results. */
merge (tmp, n1, src + n1, n2, src);
}
break;
}
}
#undef ELEMENT
#undef COMPARE
#undef STATIC
|
