Ben Pfaff <[EMAIL PROTECTED]> writes: > Paul Eggert <[EMAIL PROTECTED]> writes: > >> Bruno Haible <[EMAIL PROTECTED]> writes: >> >>> you are now assuming an in-place sorting algorithm. If a libc were >>> to implement qsort by use of mergesort (and temporary storage), such >>> a sorting algorithm would pass you two pointers to hol_entrys in >>> different array. >> >> A minor quibble: the C standard (both C89 and C99) does not allow such >> an implementation for qsort; it requires that the arguments to the >> comparison function be bona fide pointers into the >> originally-specified array. > > But even if this is true (it does seem to be implied by the > specification in the standard, now that I've re-read it), [...]
Larry Jones points out in private mail that it is stated explicitly in 7.20.5p2. -- "...dans ce pays-ci il est bon de tuer de temps en temps un amiral pour encourager les autres." --Voltaire, _Candide_
