simultaneous multiple key sorting algorithm

[Andrei Alexandrescu]

On 1/27/12 8:26 PM, Manfred Nowak wrote:
> Andrei Alexandrescu wrote:
>
>> That's three sorts and at least one temporary array.
>
> If a temporary array is allowed, the ranks and the sum of the ranks
> might be computed by a diogonal sweep over the area defined by the two
> dimensions and populated by the elements.
>
> Population and sweep would each be linear in time.
>
> -manfred

Interesting, I have some thoughts along the same lines. Could you please 
give more detail?

Andrei