Fixed-Length Array Sorting

[Nordlöw via Digitalmars-d]

On Thursday, 7 April 2016 at 13:09:22 UTC, Andrei Alexandrescu 
wrote:
> This is a good start but we'd need a more principled attack on 
> the problem.

Ok, Andrei! Here's a start.

https://github.com/nordlow/phobos-next/blob/master/src/sortn.d

Currently uses Phobos' permutations for complete verification. 
Its complexity will of course not work for larger values such as 
16.

Supports sorting networks currently up to length 6.

More to come :)

Could you please take a look at how to handle stability of 
"equal" elements?