Sort linked list by record field

[Slowpoke]

Hello!  How do I use ListQuickSort and its compare function to sort a linked list according to a given data field within each list item?  In other words, if I have an integer "depth" field in my list records, how do I force the compare function to sort the list by increasing/decreasing depth?

Thanks!

Slowpoke 

[menchar]

You supply/designate the compare function for the sort, just write one to do that comparison. Are your list items structs?

CompareFunction (void *item1, void *item2) {

  if (item1->integerfield > item2->integerfield) return 1;
  else if (item1->integerfield < item2->integerfield) return -1;
  return 0;

}

Menchar

[Slowpoke]

Yes, my list items are structs called "NODE", which contain a field called "depth".  Your post was just the hint I needed.  Here's the final form of the compare function:

int CVICALLBACK SortByDepth (void *item1, void *item2)
{
    NODE *itemA, *itemB;
    double a, b;
   
    itemA = (NODE*)item1;
    itemB = (NODE*)item2;
   
    a = itemA->depth;
    b = itemB->depth;
   
    if (a > b)
        return 1;
    if (a == b)
        return 0;
    else
        return -1;
}

Works like a charm.  Thanks again!


Slowpoke