How does the built-in sort do? I ask because the sort routine I wrote works the same way, which is optimized for ranges with a lot of common elements.
On Mar 13, 2012, at 7:33 AM, Andrei Alexandrescu <seewebsiteforem...@erdani.org> wrote: > On 3/13/12 4:02 AM, Xinok wrote: >> On Tuesday, 13 March 2012 at 06:53:30 UTC, Chad J wrote: >>> Hey, I'd love to see more sorting algorithms in phobos. Being stuck >>> with one seems kind of... wrong. >> >> Things like this are better left to 3rd party libs. Phobos already has >> two, a stable and unstable sort, which fulfill 99% of cases. > > I think we need a good sort for ranges of ranges (e.g. array of string). > Right now sort() does pretty badly on arrays of strings with large common > prefixes. > > Andrei >
