Regarding implementing a stable sort for Phobos

[deadalnix]

Le 13/03/2012 10:19, Xinok a écrit :
> On Tuesday, 13 March 2012 at 08:37:06 UTC, deadalnix wrote:
>> I have a radix sort (that need some rework to be phobos quality) and a
>> smoothsort (that could be included in phobos).
>
> Would you mind sharing your smoothsort? I haven't implemented one myself
> and I'd love to test it out.

It is on github : 
https://github.com/deadalnix/Dsort/blob/master/sort/smooth.d

> Radix sort, on the other hand, is not a comparison sort. You'd have to
> rewrite it for every possible element and container type.
>

You can do quite a lot with a bijective transformation.