using qsort... (nv, fixed it)

BlackRider · Post by **BlackRider** » Sun Apr 13, 2003 2:26 pm

what am I doing wrong? (using a std qsort) I have a struct: struct s {int a,b,c}; and s1 > s2 iff s1.c > s2.c .: int sCmp (const s *s1, const s *s2) { return (s1->c < s2->c); }// is s1 < s2? and then I create the cmp function ptr: int cmp(const void *v1, const void *v2) {// cast v1 & v2 as type 's' and run sCmp return sCmp((s*)v1, (s*)v2); } and my qsort call: qsort(data, size, sizeof(s), cmp); // data = 's *data', size = num elements in data, sizeof(s) = width of an array element, cmp = comparison function *edit* forgot to describe the problem... it compiles and runs... just it doesn't sort... the elements are now in pretty much a random order! <img src=http://www.ezboard.com/images/emoticons/frown.gif ALT=":("> it works fine up through 7 items... after that it all seems to go to pot... *edit* LOL should have been returning 1 or -1, not 0 and 1 <img src=http://www.ezboard.com/images/emoticons/smile.gif ALT=":)"> COLORS!Edited by: <A HREF=http://pub141.ezboard.com/bxmenclan.sho ... ckRider</A> at: 4/13/03 4:19:48 pm

Post by **XMEN Gambit** » Sun Apr 13, 2003 6:09 pm

I love qsort. Especially a recursive qsort. <img src=http://www.ezboard.com/images/emoticons/smile.gif ALT=":)"> <img src="http://www.xmenclan.org/xmengambit.gif"/> XMEN member Card-carrying DTM OKL Fish-napper Though a program be but three lines long, someday it will have to be maintained.  The Tao of Programming

BlackRider · Post by **BlackRider** » Sun Apr 13, 2003 6:27 pm

<img src=http://www.ezboard.com/images/emoticons/smile.gif ALT=":)"> COLORS!

using qsort... (nv, fixed it)

using qsort... (nv, fixed it)

Re: using qsort... (nv, fixed it)

Re: using qsort... (nv, fixed it)