Faster sort?

[Andrea Fontana via Digitalmars-d]

On Thursday, 7 April 2016 at 08:48:41 UTC, tsbockman wrote:
> LDC 64-bit:
>    boolSort(): 369 ms, 590 μs, and 6 hnsecs
>    std sort(): 13 secs, 798 ms, 107 μs, and 8 hnsecs
> So, your boolSort() is faster as expected - but not infinitely 
> so.

Yes point of my original discussion wasn't the obviusly wrong 
mesure but the greate gain over standard sort()

369ms vs 13 secs is still a lot (35x: and it increase more and 
more for bigger length... it's linear vs nlogn)