Hi,
I have a structure of 3 16-bit values. I have either 65000, 256000 or 1
million instances of this structure. I want to sort the lot of them
according to the number contained in one of the fields. Duplicate
values are allowed. So obviously if many instances of the structure
have the same value in this field, they must be together but they can be
in any order. The instances are already weakly sorted.
On modern Pentium 4/Athlon/G5, what would be the fastest algorithm to
use, and does anyone have any pointers to a fast implementation?