Function srt_heapsort

algorithm/algorithm.c:99–109

Heapsort — introsort's O(n log n) worst-case fallback. */

/* Heapsort — introsort's O(n log n) worst-case fallback. */
static void srt_heapsort(char *base, size_t n, size_t size, CompareFunc comp, void *tmp) {
    for (size_t i = n / 2; i > 0; ) {
        --i;
        srt_siftdown(base, i, n, size, comp, tmp);
    }
    for (size_t end = n; end > 1; ) {
        --end;
        swap(base, base + end * size, size);
        srt_siftdown(base, 0, end, size, comp, tmp);
    }
}

/* Median-of-3 Hoare quicksort, switching to insertion sort for small ranges and
 * to heapsort once recursion gets too deep. Recurses on the smaller partition