summaryrefslogtreecommitdiffstats
path: root/regress/lib/libc/qsort
AgeCommit message (Expand)AuthorFilesLines
2019-01-25I am retiring my old email address; replace it with my OpenBSD one.millert1-1/+1
2017-05-27Also test arrays of double and long long.millert1-142/+421
2017-05-22Add timing and test name options.millert1-12/+83
2017-05-22Instead of embedding pre-generated tables from McIlroy's "A Killermillert3-1538/+315
2017-05-21correct a return value testjsg1-1/+1
2017-05-19Add input targeted at the Bentley and McIrlroy quicksort generatedmillert1-6/+1389
2017-05-18use mergesort instead of heapsort when comparing resultsmillert1-9/+17
2017-05-17Avoid running the "killer" tests multiple times with the samemillert1-10/+19
2017-05-17Add "median of three" killer, as seen in "Introspective Sorting andmillert1-18/+44
2017-05-17Approximate nlgn instead of using libm. The same approximation maymillert2-10/+8
2017-05-17Add "killer" input from "algorithmic complexity attacks and libcmillert1-0/+12
2017-05-17There's no need to track the number of errors (and the counter mightmillert1-21/+30
2017-05-17Add qsort(3) regress based on Bentley & McIlroy's "Engineering a Sort Function"millert2-0/+276