| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| |
|
|
|
|
|
| |
This doesn't generate an input sequence up-front, but rather generates it
on the fly in response to the order in which the algorithm is comparing
elements in such a way as to invoke quadratic runtime in most quicksort
implementations.
|
| |
|
|
|
|
|
| |
The quicksort-killer testcase will require more global state, unless we go
to the effort of implementing qsort_r versions of all the sorting
algorithms. Since we're not doing that, we'll simply make the global state
explicit.
|
|
|
This is in preparation for adding an implementation of the quicksort-killer
test case, which requires a custom comparison function rather than just a
custom imput-generation function.
|
