You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
57 lines
1.4 KiB
57 lines
1.4 KiB
/*
|
|
* Copyright(C) 1999-2020, 2022 National Technology & Engineering Solutions
|
|
* of Sandia, LLC (NTESS). Under the terms of Contract DE-NA0003525 with
|
|
* NTESS, the U.S. Government retains certain rights in this software.
|
|
*
|
|
* See packages/seacas/LICENSE for details
|
|
*/
|
|
#pragma once
|
|
#include <climits>
|
|
|
|
template <typename T> inline void my_swap(T &r, T &s)
|
|
{
|
|
T tmp = r;
|
|
r = s;
|
|
s = tmp;
|
|
}
|
|
|
|
template <typename T, typename U> void siftDown(T *a, U *b, int64_t start, int64_t end)
|
|
{
|
|
int64_t root = start;
|
|
|
|
while (root * 2 + 1 < end) {
|
|
int64_t child = 2 * root + 1;
|
|
if ((child + 1 < end) && (a[child] < a[child + 1])) {
|
|
child += 1;
|
|
}
|
|
if (a[root] < a[child]) {
|
|
my_swap(a[child], a[root]);
|
|
my_swap(b[child], b[root]);
|
|
root = child;
|
|
}
|
|
else {
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
template <typename T, typename U> void my_sort(int64_t count, T ra[], U rb[])
|
|
{
|
|
int64_t start, end;
|
|
|
|
/* heapify */
|
|
for (start = (count - 2) / 2; start >= 0; start--) {
|
|
siftDown(ra, rb, start, count);
|
|
}
|
|
|
|
for (end = count - 1; end > 0; end--) {
|
|
my_swap(ra[end], ra[0]);
|
|
my_swap(rb[end], rb[0]);
|
|
siftDown(ra, rb, 0, end);
|
|
}
|
|
}
|
|
|
|
/*****************************************************************************/
|
|
/*****************************************************************************/
|
|
/*****************************************************************************/
|
|
extern void print_line(const char *charstr, int ntimes);
|
|
|