sorting, O(n^2) and O(n log(n))

[Marcus Comstedt (ACROSS) (Hail Ilpalazzo!) @ Pike (-) developers forum]

In this case, the sorting key appears to be a fixed size integer,
which means you could use radixsort, which is O(n)...  ;-)