summaryrefslogtreecommitdiff
Commit message (Expand)AuthorAgeFilesLines
* Shrink rotate function a bitHEADmasterBobby Bingham2014-11-111-11/+9
* Optimize buffer stealing stepBobby Bingham2014-11-041-18/+16
* Remove unused parameterBobby Bingham2014-11-041-2/+2
* Fill buffer with smallest elementsBobby Bingham2014-11-023-3/+36
* Switch to a stationary buffer, rather than moving it through the arrayBobby Bingham2014-11-021-37/+35
* Set output to unbuffered so results are visible soonerBobby Bingham2014-10-291-0/+2
* Perform swaps in larger chunks in merge stepBobby Bingham2014-10-291-11/+20
* Add debugging assertionBobby Bingham2014-10-295-6/+10
* Add instrumentationBobby Bingham2014-10-2912-8/+99
* Split helper functions into their own translation unitsBobby Bingham2014-10-267-92/+115
* Fix buffer distribution stepBobby Bingham2014-10-261-1/+1
* Rework block merge sort algorithmBobby Bingham2014-10-261-28/+36
* Fix grailsort block mergingBobby Bingham2014-09-011-28/+28
* Add concatenated sorted arrays testcaseBobby Bingham2014-09-011-0/+8
* Add -lrt to buildBobby Bingham2014-09-011-1/+1
* Add changes missing from last commitBobby Bingham2014-09-011-1/+2
* Add musl's old heap sortBobby Bingham2014-09-013-2/+40
* Add the system's qsort implementation to the comparisonBobby Bingham2014-08-311-0/+1
* Use binary search in distribute bufferBobby Bingham2014-08-231-5/+2
* Use binary search in mergeBobby Bingham2014-08-231-4/+3
* Optimize rotateBobby Bingham2014-08-182-17/+15
* Slightly simplify grailsortBobby Bingham2014-08-161-7/+8
* Delete portions of grailsort reference code we're not usingBobby Bingham2014-08-161-136/+19
* Remove duplicate declarations of MIN_SIZE and MAX_SIZEBobby Bingham2014-08-031-3/+0
* Add quicksort-killer testcaseBobby Bingham2014-08-031-0/+31
* Make global state explicit in testcase generatorsBobby Bingham2014-08-035-26/+23
* Rename generators to testcasesBobby Bingham2014-08-035-110/+119
* Remove unnecessary test of bnmelBobby Bingham2014-08-031-1/+1
* ReformatBobby Bingham2014-07-311-10/+3
* Remove grailsort dependency on bsearchBobby Bingham2014-07-311-3/+3
* Optimize swap for larger swapsBobby Bingham2014-07-311-0/+14
* Don't pre-sort the temp swap bufferBobby Bingham2014-07-311-4/+5
* Don't special-case reverse sort orderBobby Bingham2014-07-311-6/+0
* Use linear search when distributing bufferBobby Bingham2014-07-311-4/+2
* Add reference grailsort implementationBobby Bingham2014-07-313-0/+516
* Factor out binary_searchBobby Bingham2014-07-172-21/+26
* Vastly improve performance of distribute_bufferBobby Bingham2014-07-061-10/+11
* Move wikisort/grailsort common code to a shared headerBobby Bingham2014-07-064-210/+123
* Add a generator for slightly noisy reverse order dataBobby Bingham2014-07-061-9/+20
* Add an implementation of grailsortBobby Bingham2014-07-063-0/+194
* 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
* Add generator of mostly sorted dataBobby Bingham2014-06-291-4/+20
* Build with -OsBobby Bingham2014-06-291-1/+1
generated by cgit v1.2.3 (git 2.25.1) at 2024-05-08 17:39:27 +0000