summaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
* Add the C++ reference wikisort implementationBobby Bingham2014-07-044-8/+985
|
* Remove unnecessary safeguard in rotateBobby Bingham2014-06-301-1/+0
|
* Move penda info into a struct arrayBobby Bingham2014-06-301-24/+25
|
* Small cleanupBobby Bingham2014-06-301-5/+2
|
* Use an array structure to track the temp bufferBobby Bingham2014-06-301-12/+13
|
* Rename stract blockarray to more generic "array"Bobby Bingham2014-06-291-15/+15
|
* Don't bother merging when there are no pending elementsBobby Bingham2014-06-291-3/+6
|
* Don't roll a b block if it doesn't make sense toBobby Bingham2014-06-291-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 generator of mostly sorted dataBobby Bingham2014-06-291-4/+20
|
* Build with -OsBobby Bingham2014-06-291-1/+1
|
* Run smaller test cases before largerBobby Bingham2014-06-291-2/+2
|
* Move assert_sorted helper somewhere more publicBobby Bingham2014-06-293-10/+15
|
* Generate nicer numbers for debuggingBobby Bingham2014-06-291-1/+14
|
* Add wikisort optimizations for some common casesBobby Bingham2014-06-291-0/+9
|
* Initial stab at wikisortBobby Bingham2014-06-294-1/+227
|
* Add freebsd's qsortBobby Bingham2014-06-213-0/+168
|
* validate that sorter succeeded in sorting the inputBobby Bingham2014-06-211-0/+11
|
* Add glibc's sortsBobby Bingham2014-06-216-4/+566
| | | | Also rename musl's sort function for more consistency.
* Initial commit: benchmark musl's qsortBobby Bingham2014-06-207-0/+369