qsort comparisons - qsort algorithm comparative benchmarks

	Commit message (Collapse)	Author	Age	Files	Lines
*	Use binary search in merge	Bobby Bingham	2014-08-23	1	-4/+3
\|
*	Slightly simplify grailsort	Bobby Bingham	2014-08-16	1	-7/+8
\| \| \| \| \|	Remove unused pending variable, and unused return value from merge(). Saves 29 bytes on x86_64.
*	Remove unnecessary test of bnmel	Bobby Bingham	2014-08-03	1	-1/+1
\|
*	Reformat	Bobby Bingham	2014-07-31	1	-10/+3
\|
*	Remove grailsort dependency on bsearch	Bobby Bingham	2014-07-31	1	-3/+3
\|
*	Don't pre-sort the temp swap buffer	Bobby Bingham	2014-07-31	1	-4/+5
\| \| \| \| \| \| \| \| \|	This is a close call. On the one hand, this buffer will get jumbled when used for merging adjacent blocks, so we'll need to sort it again before distributing it. On the other hand, by sorting it early, we know that we won't have to distribute it very far. In testing, pre-sorting seems to lose out overall.
*	Don't special-case reverse sort order	Bobby Bingham	2014-07-31	1	-6/+0
\| \| \| \|	This increases code size, and doesn't seem to help very significantly.
*	Move wikisort/grailsort common code to a shared header	Bobby Bingham	2014-07-06	1	-109/+8
\|
*	Add an implementation of grailsort	Bobby Bingham	2014-07-06	1	-0/+192