Qsort and Dynamic Array

[Thantos]

I'm 90% certain the problem is with how I'm using qsort().
I verified that the compare function works by using bubble sort. I must be overlooking something but not sure what.

Well here is the code, maybe one of you can point me to the right spot (or wrong spot depending on how you look at it )

Note: Code attached due to length.

[swoopy]

>qsort(sorted[0], (size_t)test.size, sizeof(sorted[0]), compare);

Try:
qsort(sorted, (size_t)test.size, sizeof(sorted[0]), compare);

[Thantos]

Thanks. It worked for an already sorted array however when I put in random numbers instead it didn't sort them.

[Salem]

Your compare function is missing a level of indirection.
Your array is an array of pointers, so the compare function gets pointers to pointers

int compare (const void * a, const void * b)
{
  struct node * const *x = a;
  struct node * const *y = b;
  /*printf("%d %d\n", x->x, y->x);*/
  if ( (*x)->x > (*y)->x)
    return 1;
  else if ( (*x)->x < (*y)->x)
    return -1;
  else
    return 0;

}

[Thantos]

Thanks both of you. That did it.

Salem: Just want to repeat back what I think you are saying: Since my array is an array of pointers (hence the **) that means that my compare my also have double layered pointers?

[Salem]

Try it with a typedef

If you have an array of type T, then the compare function is called with two pointers of type T*