qsort comparisons - qsort algorithm comparative benchmarks

	Commit message (Collapse)	Author	Age	Files	Lines
*	Remove unnecessary safeguard in rotate	Bobby Bingham	2014-06-30	1	-1/+0
\|
*	Move penda info into a struct array	Bobby Bingham	2014-06-30	1	-24/+25
\|
*	Small cleanup	Bobby Bingham	2014-06-30	1	-5/+2
\|
*	Use an array structure to track the temp buffer	Bobby Bingham	2014-06-30	1	-12/+13
\|
*	Rename stract blockarray to more generic "array"	Bobby Bingham	2014-06-29	1	-15/+15
\|
*	Don't bother merging when there are no pending elements	Bobby Bingham	2014-06-29	1	-3/+6
\|
*	Don't roll a b block if it doesn't make sense to	Bobby Bingham	2014-06-29	1	-6/+2
\| \| \| \| \| \| \|	This added a pathological case where each iteration we'd roll a b block into place, just to have to do a giant rotate to move all the accumulated b blocks over to make room for the a block that should have been inserted next.
*	Add wikisort optimizations for some common cases	Bobby Bingham	2014-06-29	1	-0/+9
\|
*	Initial stab at wikisort	Bobby Bingham	2014-06-29	1	-0/+224