Replacement of sorted insertion by a qsort() between the passes
Replacement of sorted insertion by a qsort() between the passes

It should be more efficient to insert links at the end of the array
and then qsort(3) the final array rather than performing sorted insertion.
faelys/libsoldout,tin-pot/libsoldout,faelys/libsoldout,tin-pot/libsoldout