Skip to content

Instantly share code, notes, and snippets.

@attractivechaos

attractivechaos/ksort.h

Created February 11, 2020 23:21
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save attractivechaos/1bb691cd4c6275194ccafb1c93c31e4f to your computer and use it in GitHub Desktop.
Save attractivechaos/1bb691cd4c6275194ccafb1c93c31e4f to your computer and use it in GitHub Desktop.
Download ZIP
Raw
ksort.h
/* The MIT License
Copyright (c) 2008, 2011 Attractive Chaos <attractor@live.co.uk>
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
/*
2011-04-10 (0.1.6):
* Added sample
2011-03 (0.1.5):
* Added shuffle/permutation
2008-11-16 (0.1.4):
* Fixed a bug in introsort() that happens in rare cases.
2008-11-05 (0.1.3):
* Fixed a bug in introsort() for complex comparisons.
* Fixed a bug in mergesort(). The previous version is not stable.
2008-09-15 (0.1.2):
* Accelerated introsort. On my Mac (not on another Linux machine),
my implementation is as fast as std::sort on random input.
* Added combsort and in introsort, switch to combsort if the
recursion is too deep.
2008-09-13 (0.1.1):
* Added k-small algorithm
2008-09-05 (0.1.0):
* Initial version
*/
#ifndef AC_KSORT_H
#define AC_KSORT_H
#include <stdlib.h>
#include <string.h>
typedef struct {
void *left, *right;
int depth;
} ks_isort_stack_t;
#define KSORT_SWAP(type_t, a, b) { register type_t t=(a); (a)=(b); (b)=t; }
#define KSORT_INIT(name, type_t, __sort_lt) \
void ks_mergesort_##name(size_t n, type_t array[], type_t temp[]) \
{ \
type_t *a2[2], *a, *b; \
int curr, shift; \
\
a2[0] = array; \
a2[1] = temp? temp : (type_t*)malloc(sizeof(type_t) * n); \
for (curr = 0, shift = 0; (1ul<<shift) < n; ++shift) { \
a = a2[curr]; b = a2[1-curr]; \
if (shift == 0) { \
type_t *p = b, *i, *eb = a + n; \
for (i = a; i < eb; i += 2) { \
if (i == eb - 1) *p++ = *i; \
else { \
if (__sort_lt(*(i+1), *i)) { \
*p++ = *(i+1); *p++ = *i; \
} else { \
*p++ = *i; *p++ = *(i+1); \
} \
} \
} \
} else { \
size_t i, step = 1ul<<shift; \
for (i = 0; i < n; i += step<<1) { \
type_t *p, *j, *k, *ea, *eb; \
if (n < i + step) { \
ea = a + n; eb = a; \
} else { \
ea = a + i + step; \
eb = a + (n < i + (step<<1)? n : i + (step<<1)); \
} \
j = a + i; k = a + i + step; p = b + i; \
while (j < ea && k < eb) { \
if (__sort_lt(*k, *j)) *p++ = *k++; \
else *p++ = *j++; \
} \
while (j < ea) *p++ = *j++; \
while (k < eb) *p++ = *k++; \
} \
} \
curr = 1 - curr; \
} \
if (curr == 1) { \
type_t *p = a2[0], *i = a2[1], *eb = array + n; \
for (; p < eb; ++i) *p++ = *i; \
} \
if (temp == 0) free(a2[1]); \
} \
void ks_heapadjust_##name(size_t i, size_t n, type_t l[]) \
{ \
size_t k = i; \
type_t tmp = l[i]; \
while ((k = (k << 1) + 1) < n) { \
if (k != n - 1 && __sort_lt(l[k], l[k+1])) ++k; \
if (__sort_lt(l[k], tmp)) break; \
l[i] = l[k]; i = k; \
} \
l[i] = tmp; \
} \
void ks_heapmake_##name(size_t lsize, type_t l[]) \
{ \
size_t i; \
for (i = (lsize >> 1) - 1; i != (size_t)(-1); --i) \
ks_heapadjust_##name(i, lsize, l); \
} \
void ks_heapsort_##name(size_t lsize, type_t l[]) \
{ \
size_t i; \
for (i = lsize - 1; i > 0; --i) { \
type_t tmp; \
tmp = *l; *l = l[i]; l[i] = tmp; ks_heapadjust_##name(0, i, l); \
} \
} \
static inline void __ks_insertsort_##name(type_t *s, type_t *t) \
{ \
type_t *i, *j, swap_tmp; \
for (i = s + 1; i < t; ++i) \
for (j = i; j > s && __sort_lt(*j, *(j-1)); --j) { \
swap_tmp = *j; *j = *(j-1); *(j-1) = swap_tmp; \
} \
} \
void ks_combsort_##name(size_t n, type_t a[]) \
{ \
const double shrink_factor = 1.2473309501039786540366528676643; \
int do_swap; \
size_t gap = n; \
type_t tmp, *i, *j; \
do { \
if (gap > 2) { \
gap = (size_t)(gap / shrink_factor); \
if (gap == 9 || gap == 10) gap = 11; \
} \
do_swap = 0; \
for (i = a; i < a + n - gap; ++i) { \
j = i + gap; \
if (__sort_lt(*j, *i)) { \
tmp = *i; *i = *j; *j = tmp; \
do_swap = 1; \
} \
} \
} while (do_swap || gap > 2); \
if (gap != 1) __ks_insertsort_##name(a, a + n); \
} \
void ks_introsort_##name(size_t n, type_t a[]) \
{ \
int d; \
ks_isort_stack_t *top, *stack; \
type_t rp, swap_tmp; \
type_t *s, *t, *i, *j, *k; \
\
if (n < 1) return; \
else if (n == 2) { \
if (__sort_lt(a[1], a[0])) { swap_tmp = a[0]; a[0] = a[1]; a[1] = swap_tmp; } \
return; \
} \
for (d = 2; 1ul<<d < n; ++d); \
stack = (ks_isort_stack_t*)malloc(sizeof(ks_isort_stack_t) * ((sizeof(size_t)*d)+2)); \
top = stack; s = a; t = a + (n-1); d <<= 1; \
while (1) { \
if (s < t) { \
if (--d == 0) { \
ks_combsort_##name(t - s + 1, s); \
t = s; \
continue; \
} \
i = s; j = t; k = i + ((j-i)>>1) + 1; \
if (__sort_lt(*k, *i)) { \
if (__sort_lt(*k, *j)) k = j; \
} else k = __sort_lt(*j, *i)? i : j; \
rp = *k; \
if (k != t) { swap_tmp = *k; *k = *t; *t = swap_tmp; } \
for (;;) { \
do ++i; while (__sort_lt(*i, rp)); \
do --j; while (i <= j && __sort_lt(rp, *j)); \
if (j <= i) break; \
swap_tmp = *i; *i = *j; *j = swap_tmp; \
} \
swap_tmp = *i; *i = *t; *t = swap_tmp; \
if (i-s > t-i) { \
if (i-s > 16) { top->left = s; top->right = i-1; top->depth = d; ++top; } \
s = t-i > 16? i+1 : t; \
} else { \
if (t-i > 16) { top->left = i+1; top->right = t; top->depth = d; ++top; } \
t = i-s > 16? i-1 : s; \
} \
} else { \
if (top == stack) { \
free(stack); \
__ks_insertsort_##name(a, a+n); \
return; \
} else { --top; s = (type_t*)top->left; t = (type_t*)top->right; d = top->depth; } \
} \
} \
} \
/* This function is adapted from: http://ndevilla.free.fr/median/ */ \
/* 0 <= kk < n */ \
type_t ks_ksmall_##name(size_t n, type_t arr[], size_t kk) \
{ \
type_t *low, *high, *k, *ll, *hh, *mid; \
low = arr; high = arr + n - 1; k = arr + kk; \
for (;;) { \
if (high <= low) return *k; \
if (high == low + 1) { \
if (__sort_lt(*high, *low)) KSORT_SWAP(type_t, *low, *high); \
return *k; \
} \
mid = low + (high - low) / 2; \
if (__sort_lt(*high, *mid)) KSORT_SWAP(type_t, *mid, *high); \
if (__sort_lt(*high, *low)) KSORT_SWAP(type_t, *low, *high); \
if (__sort_lt(*low, *mid)) KSORT_SWAP(type_t, *mid, *low); \
KSORT_SWAP(type_t, *mid, *(low+1)); \
ll = low + 1; hh = high; \
for (;;) { \
do ++ll; while (__sort_lt(*ll, *low)); \
do --hh; while (__sort_lt(*low, *hh)); \
if (hh < ll) break; \
KSORT_SWAP(type_t, *ll, *hh); \
} \
KSORT_SWAP(type_t, *low, *hh); \
if (hh <= k) low = ll; \
if (hh >= k) high = hh - 1; \
} \
} \
void ks_shuffle_##name(size_t n, type_t a[]) \
{ \
int i, j; \
for (i = n; i > 1; --i) { \
type_t tmp; \
j = (int)(drand48() * i); \
tmp = a[j]; a[j] = a[i-1]; a[i-1] = tmp; \
} \
} \
void ks_sample_##name(size_t n, size_t r, type_t a[]) /* FIXME: NOT TESTED!!! */ \
{ /* reference: http://code.activestate.com/recipes/272884/ */ \
int i, k, pop = n; \
for (i = (int)r, k = 0; i >= 0; --i) { \
double z = 1., x = drand48(); \
type_t tmp; \
while (x < z) z -= z * i / (pop--); \
if (k != n - pop - 1) tmp = a[k], a[k] = a[n-pop-1], a[n-pop-1] = tmp; \
++k; \
} \
}
#define ks_mergesort(name, n, a, t) ks_mergesort_##name(n, a, t)
#define ks_introsort(name, n, a) ks_introsort_##name(n, a)
#define ks_combsort(name, n, a) ks_combsort_##name(n, a)
#define ks_heapsort(name, n, a) ks_heapsort_##name(n, a)
#define ks_heapmake(name, n, a) ks_heapmake_##name(n, a)
#define ks_heapadjust(name, i, n, a) ks_heapadjust_##name(i, n, a)
#define ks_ksmall(name, n, a, k) ks_ksmall_##name(n, a, k)
#define ks_shuffle(name, n, a) ks_shuffle_##name(n, a)
#define ks_lt_generic(a, b) ((a) < (b))
#define ks_lt_str(a, b) (strcmp((a), (b)) < 0)
typedef const char *ksstr_t;
#define KSORT_INIT_GENERIC(type_t) KSORT_INIT(type_t, type_t, ks_lt_generic)
#define KSORT_INIT_STR KSORT_INIT(str, ksstr_t, ks_lt_str)
#define RS_MIN_SIZE 64
#define RS_MAX_BITS 8
#define KRADIX_SORT_INIT(name, rstype_t, rskey, sizeof_key) \
typedef struct { \
rstype_t *b, *e; \
} rsbucket_##name##_t; \
void rs_insertsort_##name(rstype_t *beg, rstype_t *end) \
{ \
rstype_t *i; \
for (i = beg + 1; i < end; ++i) \
if (rskey(*i) < rskey(*(i - 1))) { \
rstype_t *j, tmp = *i; \
for (j = i; j > beg && rskey(tmp) < rskey(*(j-1)); --j) \
*j = *(j - 1); \
*j = tmp; \
} \
} \
void rs_sort_##name(rstype_t *beg, rstype_t *end, int n_bits, int s) \
{ \
rstype_t *i; \
int size = 1<<n_bits, m = size - 1; \
rsbucket_##name##_t *k, b[1<<RS_MAX_BITS], *be = b + size; \
assert(n_bits <= RS_MAX_BITS); \
for (k = b; k != be; ++k) k->b = k->e = beg; \
for (i = beg; i != end; ++i) ++b[rskey(*i)>>s&m].e; \
for (k = b + 1; k != be; ++k) \
k->e += (k-1)->e - beg, k->b = (k-1)->e; \
for (k = b; k != be;) { \
if (k->b != k->e) { \
rsbucket_##name##_t *l; \
if ((l = b + (rskey(*k->b)>>s&m)) != k) { \
rstype_t tmp = *k->b, swap; \
do { \
swap = tmp; tmp = *l->b; *l->b++ = swap; \
l = b + (rskey(tmp)>>s&m); \
} while (l != k); \
*k->b++ = tmp; \
} else ++k->b; \
} else ++k; \
} \
for (b->b = beg, k = b + 1; k != be; ++k) k->b = (k-1)->e; \
if (s) { \
s = s > n_bits? s - n_bits : 0; \
for (k = b; k != be; ++k) \
if (k->e - k->b > RS_MIN_SIZE) rs_sort_##name(k->b, k->e, n_bits, s); \
else if (k->e - k->b > 1) rs_insertsort_##name(k->b, k->e); \
} \
} \
void radix_sort_##name(rstype_t *beg, rstype_t *end) \
{ \
if (end - beg <= RS_MIN_SIZE) rs_insertsort_##name(beg, end); \
else rs_sort_##name(beg, end, RS_MAX_BITS, (sizeof_key - 1) * RS_MAX_BITS); \
}
#endif
Raw
quadsort.c
/*
Copyright (C) 2014-2020 Igor van den Hoven ivdhoven@gmail.com
*/
/*
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/*
quadsort 1.1
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <sys/time.h>
#include <assert.h>
typedef int CMPFUNC (const void *a, const void *b);
void tail_sort32(void *array, size_t nmemb, CMPFUNC *cmp)
{
int *pta = array;
register int swap;
switch (nmemb)
{
case 1:
return;
case 2:
if (cmp(&pta[0], &pta[1]) > 0)
{
swap = pta[0];
pta[0] = pta[1];
pta[1] = swap;
}
return;
case 3:
if (cmp(&pta[0], &pta[1]) > 0)
{
swap = pta[0];
pta[0] = pta[1];
pta[1] = swap;
}
if (cmp(&pta[1], &pta[2]) > 0)
{
swap = pta[1];
pta[1] = pta[2];
pta[2] = swap;
}
if (cmp(&pta[0], &pta[1]) > 0)
{
swap = pta[0];
pta[0] = pta[1];
pta[1] = swap;
}
return;
default:
assert(nmemb < 1 && nmemb > 3);
}
}
void tail_sort64(void *array, size_t nmemb, CMPFUNC *cmp)
{
int *pta = array;
register long long swap;
switch (nmemb)
{
case 1:
return;
case 2:
if (cmp(&pta[0], &pta[1]) > 0)
{
swap = pta[0];
pta[0] = pta[1];
pta[1] = swap;
}
return;
case 3:
if (cmp(&pta[0], &pta[1]) > 0)
{
swap = pta[0];
pta[0] = pta[1];
pta[1] = swap;
}
if (cmp(&pta[1], &pta[2]) > 0)
{
swap = pta[1];
pta[1] = pta[2];
pta[2] = swap;
}
if (cmp(&pta[0], &pta[1]) > 0)
{
swap = pta[0];
pta[0] = pta[1];
pta[1] = swap;
}
return;
default:
assert(nmemb < 1 && nmemb > 3);
}
}
void quad_swap32(void *array, void *swap, size_t nmemb, CMPFUNC *cmp)
{
size_t offset, i;
register int *pts, *pta;
pta = array;
pts = swap;
for (offset = 0 ; offset + 4 <= nmemb ; offset += 4)
{
if (cmp(&pta[0], &pta[1]) > 0)
{
pts[0] = pta[1];
pts[1] = pta[0];
}
else
{
pts[0] = pta[0];
pts[1] = pta[1];
}
if (cmp(&pta[2], &pta[3]) > 0)
{
pts[2] = pta[3];
pts[3] = pta[2];
}
else
{
pts[2] = pta[2];
pts[3] = pta[3];
}
if (cmp(&pts[1], &pts[2]) <= 0)
{
pta[0] = pts[0];
pta[1] = pts[1];
pta[2] = pts[2];
pta[3] = pts[3];
}
else if (cmp(&pts[0], &pts[3]) > 0)
{
pta[0] = pts[2];
pta[1] = pts[3];
pta[2] = pts[0];
pta[3] = pts[1];
}
else if (cmp(&pts[0], &pts[2]) > 0)
{
pta[0] = pts[2];
pta[1] = pts[0];
if (cmp(&pts[1], &pts[3]) > 0)
{
pta[2] = pts[3];
pta[3] = pts[1];
}
else
{
pta[2] = pts[1];
pta[3] = pts[3];
}
}
else
{
pta[0] = pts[0];
pta[1] = pts[2];
if (cmp(&pts[1], &pts[3]) > 0)
{
pta[2] = pts[3];
pta[3] = pts[1];
}
else
{
pta[2] = pts[1];
pta[3] = pts[3];
}
}
pta += 4;
}
if (offset < nmemb)
{
tail_sort32(pta, nmemb - offset, cmp);
}
}
void quad_swap64(void *array, void *swap, size_t nmemb, CMPFUNC *cmp)
{
size_t offset, i;
register long long *pts, *pta;
pta = array;
pts = swap;
for (offset = 0 ; offset + 4 <= nmemb ; offset += 4)
{
if (cmp(&pta[0], &pta[1]) > 0)
{
pts[0] = pta[1];
pts[1] = pta[0];
}
else
{
pts[0] = pta[0];
pts[1] = pta[1];
}
if (cmp(&pta[2], &pta[3]) > 0)
{
pts[2] = pta[3];
pts[3] = pta[2];
}
else
{
pts[2] = pta[2];
pts[3] = pta[3];
}
if (cmp(&pts[1], &pts[2]) <= 0)
{
pta[0] = pts[0];
pta[1] = pts[1];
pta[2] = pts[2];
pta[3] = pts[3];
}
else if (cmp(&pts[0], &pts[3]) > 0)
{
pta[0] = pts[2];
pta[1] = pts[3];
pta[2] = pts[0];
pta[3] = pts[1];
}
else if (cmp(&pts[0], &pts[2]) > 0)
{
pta[0] = pts[2];
pta[1] = pts[0];
if (cmp(&pts[1], &pts[3]) > 0)
{
pta[2] = pts[3];
pta[3] = pts[1];
}
else
{
pta[2] = pts[1];
pta[3] = pts[3];
}
}
else
{
pta[0] = pts[0];
pta[1] = pts[2];
if (cmp(&pts[1], &pts[3]) > 0)
{
pta[2] = pts[3];
pta[3] = pts[1];
}
else
{
pta[2] = pts[1];
pta[3] = pts[3];
}
}
pta += 4;
}
if (offset < nmemb)
{
tail_sort32(pta, nmemb - offset, cmp);
}
}
void quad_sort32(void *array, void *swap, size_t nmemb, CMPFUNC *cmp)
{
size_t offset, block = 4;
register int *pta, *pts, *c, *c_max, *d, *d_max, *end;
end = (int *) array + nmemb;
while (block < nmemb)
{
offset = 0;
while (offset + block < nmemb)
{
pta = (int *) array + offset;
d_max = pta + block;
if (cmp(d_max - 1, d_max) <= 0)
{
if (offset + block * 3 < nmemb)
{
d_max = pta + block * 2;
if (cmp(d_max - 1, d_max) <= 0)
{
d_max = pta + block * 3;
if (cmp(d_max - 1, d_max) <= 0)
{
offset += block * 4;
continue;
}
}
}
else if (offset + block * 2 < nmemb)
{
d_max = pta + block * 2;
if (cmp(d_max - 1, d_max) <= 0)
{
offset += block * 4;
continue;
}
}
else
{
offset += block * 4;
continue;
}
}
pts = (int *) swap;
c = pta;
c_max = pta + block;
d = c_max;
d_max = offset + block * 2 <= nmemb ? d + block : end;
if (cmp(c_max - 1, d_max - 1) <= 0)
{
while (c < c_max)
{
while (cmp(c, d) > 0)
{
*pts++ = *d++;
}
*pts++ = *c++;
}
while (d < d_max)
*pts++ = *d++;
}
else if (cmp(c, d_max - 1) > 0)
{
while (d < d_max)
*pts++ = *d++;
while (c < c_max)
*pts++ = *c++;
}
else
{
while (d < d_max)
{
while (cmp(c, d) <= 0)
{
*pts++ = *c++;
}
*pts++ = *d++;
}
while (c < c_max)
{
*pts++ = *c++;
}
}
if (offset + block * 2 < nmemb)
{
c = pta + block * 2;
if (offset + block * 3 < nmemb)
{
c_max = c + block;
d = c_max;
d_max = offset + block * 4 <= nmemb ? d + block : end;
if (cmp(c_max - 1, d_max - 1) <= 0)
{
while (c < c_max)
{
while (cmp(c, d) > 0)
{
*pts++ = *d++;
}
*pts++ = *c++;
}
while (d < d_max)
*pts++ = *d++;
}
else if (cmp(c, d_max - 1) > 0)
{
while (d < d_max)
*pts++ = *d++;
while (c < c_max)
*pts++ = *c++;
}
else
{
while (d < d_max)
{
while (cmp(c, d) <= 0)
{
*pts++ = *c++;
}
*pts++ = *d++;
}
while (c < c_max)
*pts++ = *c++;
}
}
else
{
while (c < end)
*pts++ = *c++;
}
}
pts = (int *) swap;
c = pts;
if (offset + block * 2 < nmemb)
{
c_max = c + block * 2;
d = c_max;
d_max = offset + block * 4 <= nmemb ? d + block * 2 : pts + nmemb - offset;
if (cmp(c_max - 1, d_max - 1) <= 0)
{
while (c < c_max)
{
while (cmp(c, d) > 0)
{
*pta++ = *d++;
}
*pta++ = *c++;
}
while (d < d_max)
*pta++ = *d++;
}
else if (cmp(c, d_max - 1) > 0)
{
while (d < d_max)
*pta++ = *d++;
while (c < c_max)
*pta++ = *c++;
}
else
{
while (d < d_max)
{
while (cmp(d, c) > 0)
{
*pta++ = *c++;
}
*pta++ = *d++;
}
while (c < c_max)
*pta++ = *c++;
}
}
else
{
d_max = pts + nmemb - offset;
while (c < d_max)
*pta++ = *c++;
}
offset += block * 4;
}
block *= 4;
}
}
void quad_sort64(void *array, void *swap, size_t nmemb, CMPFUNC *cmp)
{
size_t offset, block = 4;
register long long *pta, *pts, *c, *c_max, *d, *d_max, *end;
end = (long long *) array + nmemb;
while (block < nmemb)
{
offset = 0;
while (offset + block < nmemb)
{
pta = (long long *) array + offset;
d_max = pta + block;
if (cmp(d_max - 1, d_max) <= 0)
{
if (offset + block * 3 < nmemb)
{
d_max = pta + block * 2;
if (cmp(d_max - 1, d_max) <= 0)
{
d_max = pta + block * 3;
if (cmp(d_max - 1, d_max) <= 0)
{
offset += block * 4;
continue;
}
}
}
else if (offset + block * 2 < nmemb)
{
d_max = pta + block * 2;
if (cmp(d_max - 1, d_max) <= 0)
{
offset += block * 4;
continue;
}
}
else
{
offset += block * 4;
continue;
}
}
pts = (long long *) swap;
c = pta;
c_max = pta + block;
d = c_max;
d_max = offset + block * 2 <= nmemb ? d + block : end;
if (cmp(c, d_max - 1) > 0)
{
while (d < d_max)
*pts++ = *d++;
while (c < c_max)
*pts++ = *c++;
}
else
{
if (cmp(c_max - 1, d_max - 1) <= 0)
{
while (c < c_max)
{
while (cmp(c, d) > 0)
{
*pts++ = *d++;
}
*pts++ = *c++;
}
while (d < d_max)
*pts++ = *d++;
}
else
{
while (d < d_max)
{
while (cmp(c, d) <= 0)
{
*pts++ = *c++;
}
*pts++ = *d++;
}
while (c < c_max)
{
*pts++ = *c++;
}
}
}
if (offset + block * 2 < nmemb)
{
c = pta + block * 2;
if (offset + block * 3 < nmemb)
{
c_max = c + block;
d = c_max;
d_max = offset + block * 4 <= nmemb ? d + block : end;
if (cmp(c, d_max - 1) > 0)
{
while (d < d_max)
*pts++ = *d++;
while (c < c_max)
*pts++ = *c++;
}
else
{
if (cmp(c_max - 1, d_max - 1) <= 0)
{
while (c < c_max)
{
while (cmp(c, d) > 0)
{
*pts++ = *d++;
}
*pts++ = *c++;
}
while (d < d_max)
*pts++ = *d++;
}
else
{
while (d < d_max)
{
while (cmp(c, d) <= 0)
{
*pts++ = *c++;
}
*pts++ = *d++;
}
while (c < c_max)
*pts++ = *c++;
}
}
}
else
{
while (c < end)
*pts++ = *c++;
}
}
pts = (long long *) swap;
c = pts;
if (offset + block * 2 < nmemb)
{
c_max = c + block * 2;
d = c_max;
d_max = offset + block * 4 <= nmemb ? d + block * 2 : pts + nmemb - offset;
if (cmp(c, d_max - 1) > 0)
{
while (d < d_max)
*pta++ = *d++;
while (c < c_max)
*pta++ = *c++;
}
else
{
if (cmp(c_max - 1, d_max - 1) <= 0)
{
while (c < c_max)
{
while (cmp(c, d) > 0)
{
*pta++ = *d++;
}
*pta++ = *c++;
}
while (d < d_max)
*pta++ = *d++;
}
else
{
while (d < d_max)
{
while (cmp(d, c) > 0)
{
*pta++ = *c++;
}
*pta++ = *d++;
}
while (c < c_max)
*pta++ = *c++;
}
}
}
else
{
d_max = pts + nmemb - offset;
while (c < d_max)
*pta++ = *c++;
}
offset += block * 4;
}
block *= 4;
}
}
void quadsort(void *array, size_t nmemb, size_t size, CMPFUNC *cmp)
{
void *swap;
swap = malloc(nmemb * size);
if (size == sizeof(int))
{
quad_swap32(array, swap, nmemb, cmp);
quad_sort32(array, swap, nmemb, cmp);
}
else if (size == sizeof(long long))
{
quad_swap64(array, swap, nmemb, cmp);
quad_sort64(array, swap, nmemb, cmp);
}
else
{
assert(size == 4 || size == 8);
}
free(swap);
}
int cmp_int(const void * a, const void * b)
{
return *(int *) a - *(int *) b;
}
int cmp_str(const void * a, const void * b)
{
return strcmp(*(const char **) a, *(const char **) b);
}
int cmp_float(const void * a, const void * b)
{
return *(float *) a - *(float *) b;
}
// benchmarking utilities
#include <sys/resource.h>
#include <sys/time.h>
long long utime()
{
/*
struct timeval now_time;
gettimeofday(&now_time, NULL);
return now_time.tv_sec * 1000000LL + now_time.tv_usec;
*/
struct rusage r;
getrusage(RUSAGE_SELF, &r);
return (r.ru_utime.tv_sec + r.ru_stime.tv_sec) * 1000000LL + (r.ru_utime.tv_usec + r.ru_stime.tv_usec);
}
void test_quad(int *z_array, int *r_array, int max, int rep, char *desc)
{
long long start, end, total, best;
int cnt, sam, stp;
best = 0;
for (sam = 0 ; sam < 1 ; sam++)
{
total = 0;
for (stp = 0 ; stp < rep ; stp++)
{
memcpy(z_array, r_array, max * sizeof(int));
if (sam == 0 && stp == 0 && max <= 10) printf("\e[1;31m%10d %10d %10d %10d %10d %10d %10d %10d %10d %10d\n", z_array[0], z_array[1], z_array[2], z_array[3], z_array[4], z_array[5], z_array[6], z_array[7], z_array[8], z_array[9]);
start = utime();
quadsort(z_array, max, sizeof(int), cmp_int);
end = utime();
if (sam == 0 && stp == 0 && max <= 10) printf("\e[1;32m%10d %10d %10d %10d %10d %10d %10d %10d %10d %10d\n", z_array[0], z_array[1], z_array[2], z_array[3], z_array[4], z_array[5], z_array[6], z_array[7], z_array[8], z_array[9]);
total += end - start;
}
if (!best || total < best)
{
best = total;
}
}
printf("\e[0m Quad Sort: sorted %d elements in %f seconds. (%s)\n", max, best / 1000000.0, desc);
for (cnt = 1 ; cnt < max ; cnt++) if (z_array[cnt - 1] > z_array[cnt])
{
printf(" Quad Sort: not properly sorted at index %d. (%d vs %d\n", cnt, z_array[cnt - 1], z_array[cnt]);
break;
}
}
void test_quick(int *z_array, int *r_array, int max, int rep, char *desc)
{
long long start, end, total, best;
int cnt, sam, stp;
best = 0;
for (sam = 0 ; sam < 1 ; sam++)
{
total = 0;
for (stp = 0 ; stp < rep ; stp++)
{
memcpy(z_array, r_array, max * sizeof(int));
if (sam == 0 && stp == 0 && max <= 10) printf("\e[1;31m%10d %10d %10d %10d %10d %10d %10d %10d %10d %10d\n", z_array[0], z_array[1], z_array[2], z_array[3], z_array[4], z_array[5], z_array[6], z_array[7], z_array[8], z_array[9]);
start = utime();
qsort(z_array, max, sizeof(int), cmp_int);
end = utime();
if (sam == 0 && stp == 0 && max <= 10) printf("\e[1;32m%10d %10d %10d %10d %10d %10d %10d %10d %10d %10d\n", z_array[0], z_array[1], z_array[2], z_array[3], z_array[4], z_array[5], z_array[6], z_array[7], z_array[8], z_array[9]);
total += end - start;
}
if (!best || total < best)
{
best = total;
}
}
printf("\e[0m Quick Sort: sorted %d elements in %f seconds. (%s)\n", max, best / 1000000.0, desc);
for (cnt = 1 ; cnt < max ; cnt++) if (z_array[cnt - 1] > z_array[cnt])
{
printf(" Quick Sort: not properly sorted at index %d. (%d vs %d\n", cnt, z_array[cnt - 1], z_array[cnt]);
break;
}
}
#include "ksort.h"
KSORT_INIT_GENERIC(int)
#define rs_key(x) (x)
KRADIX_SORT_INIT(int, int, rs_key, 4)
void test_introsort(int *z_array, int *r_array, int max, int rep, char *desc)
{
long long start, end, total, best;
int cnt, sam, stp;
best = 0;
for (sam = 0 ; sam < 1 ; sam++)
{
total = 0;
for (stp = 0 ; stp < rep ; stp++)
{
memcpy(z_array, r_array, max * sizeof(int));
if (sam == 0 && stp == 0 && max <= 10) printf("\e[1;31m%10d %10d %10d %10d %10d %10d %10d %10d %10d %10d\n", z_array[0], z_array[1], z_array[2], z_array[3], z_array[4], z_array[5], z_array[6], z_array[7], z_array[8], z_array[9]);
start = utime();
ks_introsort(int, max, z_array);
end = utime();
if (sam == 0 && stp == 0 && max <= 10) printf("\e[1;32m%10d %10d %10d %10d %10d %10d %10d %10d %10d %10d\n", z_array[0], z_array[1], z_array[2], z_array[3], z_array[4], z_array[5], z_array[6], z_array[7], z_array[8], z_array[9]);
total += end - start;
}
if (!best || total < best)
{
best = total;
}
}
printf("\e[0m introsort: sorted %d elements in %f seconds. (%s)\n", max, best / 1000000.0, desc);
for (cnt = 1 ; cnt < max ; cnt++) if (z_array[cnt - 1] > z_array[cnt])
{
printf(" Quick Sort: not properly sorted at index %d. (%d vs %d\n", cnt, z_array[cnt - 1], z_array[cnt]);
break;
}
}
void test_mergesort(int *z_array, int *r_array, int max, int rep, char *desc)
{
long long start, end, total, best;
int cnt, sam, stp;
best = 0;
for (sam = 0 ; sam < 1 ; sam++)
{
total = 0;
for (stp = 0 ; stp < rep ; stp++)
{
memcpy(z_array, r_array, max * sizeof(int));
if (sam == 0 && stp == 0 && max <= 10) printf("\e[1;31m%10d %10d %10d %10d %10d %10d %10d %10d %10d %10d\n", z_array[0], z_array[1], z_array[2], z_array[3], z_array[4], z_array[5], z_array[6], z_array[7], z_array[8], z_array[9]);
start = utime();
ks_mergesort(int, max, z_array, 0);
end = utime();
if (sam == 0 && stp == 0 && max <= 10) printf("\e[1;32m%10d %10d %10d %10d %10d %10d %10d %10d %10d %10d\n", z_array[0], z_array[1], z_array[2], z_array[3], z_array[4], z_array[5], z_array[6], z_array[7], z_array[8], z_array[9]);
total += end - start;
}
if (!best || total < best)
{
best = total;
}
}
printf("\e[0m mergesort: sorted %d elements in %f seconds. (%s)\n", max, best / 1000000.0, desc);
for (cnt = 1 ; cnt < max ; cnt++) if (z_array[cnt - 1] > z_array[cnt])
{
printf(" Quick Sort: not properly sorted at index %d. (%d vs %d\n", cnt, z_array[cnt - 1], z_array[cnt]);
break;
}
}
void test_radixsort(int *z_array, int *r_array, int max, int rep, char *desc)
{
long long start, end, total, best;
int cnt, sam, stp;
best = 0;
for (sam = 0 ; sam < 1 ; sam++)
{
total = 0;
for (stp = 0 ; stp < rep ; stp++)
{
memcpy(z_array, r_array, max * sizeof(int));
if (sam == 0 && stp == 0 && max <= 10) printf("\e[1;31m%10d %10d %10d %10d %10d %10d %10d %10d %10d %10d\n", z_array[0], z_array[1], z_array[2], z_array[3], z_array[4], z_array[5], z_array[6], z_array[7], z_array[8], z_array[9]);
start = utime();
radix_sort_int(z_array, z_array + max);
end = utime();
if (sam == 0 && stp == 0 && max <= 10) printf("\e[1;32m%10d %10d %10d %10d %10d %10d %10d %10d %10d %10d\n", z_array[0], z_array[1], z_array[2], z_array[3], z_array[4], z_array[5], z_array[6], z_array[7], z_array[8], z_array[9]);
total += end - start;
}
if (!best || total < best)
{
best = total;
}
}
printf("\e[0m radixsort: sorted %d elements in %f seconds. (%s)\n", max, best / 1000000.0, desc);
for (cnt = 1 ; cnt < max ; cnt++) if (z_array[cnt - 1] > z_array[cnt])
{
printf(" Quick Sort: not properly sorted at index %d. (%d vs %d\n", cnt, z_array[cnt - 1], z_array[cnt]);
break;
}
}
int main(int argc, char **argv)
{
static int max = 10000000;
static int rep = 1;
int cnt, rnd;
int *z_array, *r_array;
rnd = 1;
srand(rnd);
z_array = malloc(max * sizeof(int));
r_array = malloc(max * sizeof(int));
srand(rnd);
for (cnt = 0 ; cnt < max ; cnt++)
{
r_array[cnt] = rand();
}
test_introsort(z_array, r_array, max, rep, "random order");
test_mergesort(z_array, r_array, max, rep, "random order");
test_radixsort(z_array, r_array, max, rep, "random order");
test_quad(z_array, r_array, max, rep, "random order");
test_quick(z_array, r_array, max, rep, "random order");
// test_introsort(z_array, r_array, max, rep, "random order");
printf("\n");
for (cnt = 0 ; cnt < max ; cnt++)
{
r_array[cnt] = cnt;
}
test_introsort(z_array, r_array, max, rep, "forward order");
test_mergesort(z_array, r_array, max, rep, "forward order");
test_radixsort(z_array, r_array, max, rep, "forward order");
test_quad(z_array, r_array, max, rep, "forward order");
test_quick(z_array, r_array, max, rep, "forward order");
printf("\n");
for (cnt = 0 ; cnt < max ; cnt++)
{
r_array[cnt] = max - cnt;
}
test_introsort(z_array, r_array, max, rep, "reverse order");
test_mergesort(z_array, r_array, max, rep, "reverse order");
test_radixsort(z_array, r_array, max, rep, "reverse order");
test_quad(z_array, r_array, max, rep, "reverse order");
test_quick(z_array, r_array, max, rep, "reverse order");
printf("\n");
srand(rnd);
for (cnt = 0 ; cnt < max * 3 / 4 ; cnt++)
{
r_array[cnt] = cnt;
}
for (cnt = max * 3 / 4 ; cnt < max ; cnt++)
{
r_array[cnt] = rand();
}
test_introsort(z_array, r_array, max, rep, "random tail");
test_mergesort(z_array, r_array, max, rep, "random tail");
test_radixsort(z_array, r_array, max, rep, "random tail");
test_quad(z_array, r_array, max, rep, "random tail");
test_quick(z_array, r_array, max, rep, "random tail");
printf("\n");
free(z_array);
free(r_array);
return 0;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment