| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | I am retiring my old email address; replace it with my OpenBSD one. | millert | 2019-01-25 | 1 | -1/+1 |
| | | |||||
| * | Also test arrays of double and long long. | millert | 2017-05-27 | 1 | -142/+421 |
| | | |||||
| * | Add timing and test name options. | millert | 2017-05-22 | 1 | -12/+83 |
| | | |||||
| * | Instead of embedding pre-generated tables from McIlroy's "A Killer | millert | 2017-05-22 | 3 | -1538/+315 |
| | | | | | | Adversary for Quicksort", just include the code to generate them. Also allow the number of elements to be specified on the command line. | ||||
| * | correct a return value test | jsg | 2017-05-21 | 1 | -1/+1 |
| | | | | | ok millert@ | ||||
| * | Add input targeted at the Bentley and McIrlroy quicksort generated | millert | 2017-05-19 | 1 | -6/+1389 |
| | | | | | | by McIlroy's "A Killer Adversary for Quicksort". This results in quadratic behavior and the test aborts before completion. | ||||
| * | use mergesort instead of heapsort when comparing results | millert | 2017-05-18 | 1 | -9/+17 |
| | | |||||
| * | Avoid running the "killer" tests multiple times with the same | millert | 2017-05-17 | 1 | -10/+19 |
| | | | | | parameters. | ||||
| * | Add "median of three" killer, as seen in "Introspective Sorting and | millert | 2017-05-17 | 1 | -18/+44 |
| | | | | | Selection Algorithms" by David R Musser. | ||||
| * | Approximate nlgn instead of using libm. The same approximation may | millert | 2017-05-17 | 2 | -10/+8 |
| | | | | | be used in qsort.c in a later commit. | ||||
| * | Add "killer" input from "algorithmic complexity attacks and libc | millert | 2017-05-17 | 1 | -0/+12 |
| | | | | | | | | qsort()". This causes quadratic behavior with the 4.4BSD qsort's "switch to insertion sort" optimization when the input appears to be mostly sorted. That optimization was removed in qsort.c r1.12 but it is worth having in the regress test too. | ||||
| * | There's no need to track the number of errors (and the counter might | millert | 2017-05-17 | 1 | -21/+30 |
| | | | | | wrap), make it a flag instead. Pointed out by schwarze@ | ||||
| * | Add qsort(3) regress based on Bentley & McIlroy's "Engineering a Sort Function" | millert | 2017-05-17 | 2 | -0/+276 |
 |
index : openbsd | |
| A mirror of https://github.com/libressl/openbsd.git |
| summaryrefslogtreecommitdiff |