BUG: qsort reorders elements in already sorted array
Christopher Faylor
cgf@redhat.com
Wed Jun 4 19:43:00 GMT 2003
On Wed, Jun 04, 2003 at 06:42:07PM +0200, Corinna Vinschen wrote:
>On Wed, Jun 04, 2003 at 12:24:36PM -0400, Christopher Faylor wrote:
>> On Wed, Jun 04, 2003 at 05:50:16PM +0200, Corinna Vinschen wrote:
>> >On Wed, Jun 04, 2003 at 02:58:28PM +0200, Corinna Vinschen wrote:
>> >> had exchanged their place. As a figure, the order wasn't
>> >>
>> >> 0 1 2 3 4 5 6 7 8 9
>> >>
>> >> but
>> >>
>> >> 9 1 2 3 4 5 6 7 8 0
>> >
>> >I have a patch which works, but which perhaps slows down qsort slightly:
>>
>> There seems to be a newer version of qsort available from FreeBSD. Does it
>> work any better than the newlib version?
>
>No, it's the same code as usual, just intermixed with the additional
>code necessary to implement qsort_r. Too bad.
Any netbsd activity there, maybe?
cgf
More information about the Newlib
mailing list