Worst-case performance of quickSort / getPivot

[Andrei Alexandrescu]

On 11/16/13 9:30 PM, Jean Christophe wrote:
> An indirect sorting, assuming a and b to be ojects of class
> SomePotentialyLargeClass.
>
> Because the array to sort contains pointers only, all the data movement
> is essentially the same as if we were sorting integer.

Maybe makeIndex may be of help.

http://dlang.org/phobos/std_algorithm.html#makeIndex


Andrei