about summary refs log tree commit diff
path: root/COPYRIGHT
Commit message (Collapse)AuthorAgeFilesLines
* replace heap sort with smoothsort implementation by Valentin OchsRich Felker2011-04-271-0/+4
| | | | | | | | | | | | | | Smoothsort is an adaptive variant of heapsort. This version was written by Valentin Ochs (apo) specifically for inclusion in musl. I worked with him to get it working in O(1) memory usage even with giant array element widths, and to optimize it heavily for size and speed. It's still roughly 4 times as large as the old heap sort implementation, but roughly 20 times faster given an almost-sorted array of 1M elements (20 being the base-2 log of 1M), i.e. it really does reduce O(n log n) to O(n) in the mostly-sorted case. It's still somewhat slower than glibc's Introsort for random input, but now considerably faster than glibc when the input is already sorted, or mostly sorted.
* some docs fixes for x86_64Rich Felker2011-02-151-0/+3
|
* explicitly release crt/* to the public domainRich Felker2011-02-131-0/+6
|
* initial check-in, version 0.5.0 v0.5.0Rich Felker2011-02-121-0/+31