New fast sorting algorithm (O(n))
ketmar via Digitalmars-d
digitalmars-d at puremagic.com
Tue Jan 3 00:20:03 PST 2017
On Tuesday, 3 January 2017 at 08:01:59 UTC, Nicholas Wilson wrote:
> https://probablydance.com/2016/12/27/i-wrote-a-faster-sorting-algorithm/
>
> on reddit
>
> https://www.reddit.com/r/programming/comments/5lqgks/i_wrote_a_faster_sorting_algorithm/
ah, radix sort again, trading memory for speed. it is fairly easy
to beat standard sorts this way (and it is common to see
variations of radix sort in game engines -- mine using that too,
it is three times faster than phobos' algo).
also, the idea of in-place byte-based radix sort is hardly new
too. we've used it in demos at least two decades ago.
More information about the Digitalmars-d
mailing list