Age | Commit message (Collapse) | Author | Lines | |
---|---|---|---|---|

2012-03-16 | Merge remote branch 'nsz/master' | Rich Felker | -5/+9 | |

2012-03-16 | revert COPYRIGHT file changes in preparation to merge nsz's math branch | Rich Felker | -4/+5 | |

2012-03-16 | update copyright status (math library and new year) | Rich Felker | -6/+5 | |

2012-03-13 | fix copyright notice for the math lib | nsz | -5/+9 | |

2011-06-25 | XSI search.h API implementation by Szabolcs Nagy | Rich Felker | -3/+5 | |

2011-06-23 | initial commit of prng implementation by Szabolcs Nagy | Rich Felker | -0/+4 | |

2011-04-27 | replace heap sort with smoothsort implementation by Valentin Ochs | Rich Felker | -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. | ||||

2011-02-15 | some docs fixes for x86_64 | Rich Felker | -0/+3 | |

2011-02-13 | explicitly release crt/* to the public domain | Rich Felker | -0/+6 | |

2011-02-12 | initial check-in, version 0.5.0v0.5.0 | Rich Felker | -0/+31 | |