--- Comment #7 from Dmitry Olshansky <> 2012-09-03 
14:14:23 PDT ---
(In reply to comment #6)
> I've written a collection of sorting algorithms for D:
> I recommend using timsort.d or stablesort.d. mergesort.d is a generic
> implementation. stablequicksort.d is not recommended.
> I've extensively tested each of these modules and can confirm they're stable.
> More so, they're many times faster than the stable sort in Phobos. Lastly,
> there are no issues regarding the dollar token $ (range.length is used as
> necessary).

Yeah, I recall you had some great stuff on this. Thanks for showing up.

> I provide all of these modules to the public domain. That means anybody is 
> free
> to implement any of these modules into Phobos.

Great, I'll look into making a pull request to do just that. 
With a proper attribution, of course.

Configure issuemail:
------- You are receiving this mail because: -------

Reply via email to