Re: Sorting a data structure array...

[Hans Boldt <boldt@xxxxxxxxxx>]

Dane Cox wrote:
> Thanks Hans.  This works better, but it still isn't quite right.  It
> looks as if once it hits the first element that is 'to be moved'...in
> this case it is the second row in the ds array...then it starts doing
> strange things again.
> ...

Darn! This had me stumped. Actually, I read this trick somewhere and I 
thought it was pretty cute. But it now appears to suffer from a flaw. It 
would appear you can't really compare pointers for inequality in the 
qsort() compare function since you might not actually be pointing to an 
element *within* the array.

On the other hand, you could still use this trick if you added an 
"index" field to the structure, and used that as the secondary key for 
the compare.

Cheers! Hans