Fixed-Length Array Sorting

Marco Leise via Digitalmars-d digitalmars-d at puremagic.com
Mon Apr 4 06:07:42 PDT 2016


Am Mon, 04 Apr 2016 12:11:20 +0000
schrieb Nordlöw <per.nordlow at gmail.com>:

> On Monday, 4 April 2016 at 10:53:51 UTC, Brian Schott wrote:
> > That's too readable.  
> 
> ?
 
When you talk about optimizing there is always a "how far will
you go". Your code is still plain D and barely digestible.
Hackerpilot presents a different solution that is outright
cryptic and platform dependent, but supposedly even faster.

The humor lies in the continued obfuscation of the higher
level sort operation to the point of becoming an obfuscated
code challenge and the controversy it starts in our minds when
we demand both fast and maintainable library code.

-- 
Marco



More information about the Digitalmars-d mailing list