Hello Paul, > Such a function can lead to faster execution > in some important cases, as I have verified using GNU 'ls' as a guinea pig.
Does the speedup come from the use of the mergesort algorithm, or from avoiding a function call in the comparison function (with qsort, the pointer indirection must be done inside the comparison function; here it's done outside)? Bruno
