| Commit message (Expand) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Instead of embedding pre-generated tables from McIlroy's "A Killer | millert | 2017-05-22 | 3 | -1538/+315 |
| * | correct a return value test | jsg | 2017-05-21 | 1 | -1/+1 |
| * | Add input targeted at the Bentley and McIrlroy quicksort generated | millert | 2017-05-19 | 1 | -6/+1389 |
| * | 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 |
| * | Add "median of three" killer, as seen in "Introspective Sorting and | millert | 2017-05-17 | 1 | -18/+44 |
| * | Approximate nlgn instead of using libm. The same approximation may | millert | 2017-05-17 | 2 | -10/+8 |
| * | Add "killer" input from "algorithmic complexity attacks and libc | millert | 2017-05-17 | 1 | -0/+12 |
| * | There's no need to track the number of errors (and the counter might | millert | 2017-05-17 | 1 | -21/+30 |
| * | 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 |