Proposal: a new implementation for Data.List.sort and Data.List.sortBy, which has better performance characteristics and is more laziness-friendly.

[Siddhanathan Shanmugam]

On Sun, Mar 26, 2017 at 2:05 PM, Tobias Florek <haskell at ibotty.net> wrote:

> Hi!
>
> > Test results
>
> See e.g.
>
>  https://github.com/rust-lang/rust/pull/38192


That's a good idea actually. Maybe it would be a welcomed addition to the
https://github.com/haskell-perf/sequences benchmarks.


>
>
> for a good suite of test vectors for sort functions. I still remember
> first benchmarking a sort I wrote in university which performed well,
> but broke down (relatively) with test cases that are not random, sorted,
> rev sorted.
>
> Great work you two btw!
>
> Cheers,
>  Tob(ias Florek)
>
>
> _______________________________________________
> Libraries mailing list
> Libraries at haskell.org
> http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/libraries/attachments/20170327/1440f802/attachment.html>