mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-03-03 15:38:22 +00:00
11ec60d5fc
This change changes qsort() to use the same code as NetBSD and MacOS because it goes 6x faster than Musl's SmoothSort function. Smoothsort can still be used if you need something that's provenly linearithmic. This change also improves GNU Make performance on whole by 7 percent! netbsd nearly l: 70,196c 22,673ns m: 68,428c 22,102ns musl nearly l: 53,844c 17,391ns m: 58,726c 18,968ns unixv6 nearly l: 65,885c 21,280ns m: 63,082c 20,375ns netbsd reverse l: 120,290c 38,853ns m: 122,619c 39,605ns musl reverse l: 801,826c 258,985ns m: 794,689c 256,680ns unixv6 reverse l: 58,977c 19,049ns m: 59,764c 19,303ns netbsd random l: 146,745c 47,398ns m: 145,782c 47,087ns musl random l: 855,804c 276,420ns m: 850,912c 274,840ns unixv6 random l: 214,325c 69,226ns m: 213,906c 69,090ns netbsd 2n l: 77,299c 24,967ns m: 76,773c 24,797ns musl 2n l: 818,012c 264,213ns m: 818,282c 264,301ns unixv6 2n l: 3,967,009c 1,281,322ns m: 3,941,792c 1,273,177ns https://justine.lol/dox/sort.pdf
37 lines
2.3 KiB
C
37 lines
2.3 KiB
C
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
|
│vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
|
│ Copyright 2022 Justine Alexandra Roberts Tunney │
|
|
│ │
|
|
│ Permission to use, copy, modify, and/or distribute this software for │
|
|
│ any purpose with or without fee is hereby granted, provided that the │
|
|
│ above copyright notice and this permission notice appear in all copies. │
|
|
│ │
|
|
│ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │
|
|
│ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │
|
|
│ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │
|
|
│ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL │
|
|
│ DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR │
|
|
│ PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER │
|
|
│ TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR │
|
|
│ PERFORMANCE OF THIS SOFTWARE. │
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
|
#include "libc/mem/alg.h"
|
|
|
|
/**
|
|
* Sorts array.
|
|
*
|
|
* This implementation uses the Quicksort routine from Bentley &
|
|
* McIlroy's "Engineering a Sort Function", 1992, Bell Labs.
|
|
*
|
|
* @param base points to an array to sort in-place
|
|
* @param count is the item count
|
|
* @param width is the size of each item
|
|
* @param cmp is a callback returning <0, 0, or >0
|
|
* @see smoothsort()
|
|
* @see djbsort()
|
|
*/
|
|
void qsort(void *a, size_t n, size_t es,
|
|
int (*cmp)(const void *, const void *)) {
|
|
qsort_r(a, n, es, (void *)cmp, 0);
|
|
}
|