Faster sort?

[tsbockman via Digitalmars-d]

On Wednesday, 6 April 2016 at 08:15:39 UTC, Andrea Fontana wrote:
> Using ldmd2 -O -release -noboundscheck -inline sort.d && ./sort
>  instead:
>
> 2 inputs:
> Faster: 0 hnsecs
> Phobos: 33 μs and 5 hnsecs
>
> ...
>
> 65536 inputs:
> Faster: 0 hnsecs (???)
> Phobos: 7 secs, 865 ms, 450 μs, and 6 hnsecs

Can you share the benchmark code?

"0 hnsecs" results generally mean that your test was too simple 
and/or didn't have any obvious side effects, and so the optimizer 
just removed it completely.