Sort array of structures

[sevak316]

I have an array of structures that I would like to sort.

typedef struct
{
int param;
int priority;
} mystruct;

I have an array of them.

mystruct myarray[10];

How can I quick sort them. I have been googling around and found couple of examples, but wanted to see if you guys have a shorter method.

I want to sort the array by the structures priority.


Thanks.

[JosAH]

This example tells you all you need.

kind regards,

Jos

[sevak316]

Thank you very much for the example, it really helped. Here is what I have. It works, but I really want to understand what it does. What is the return statement in "compfunc_i nt" doing? Also, how is it getting its parameters??

Thanks.

typedef struct {
int priority;
int id;
} my_struct;

my_struct my_array[8];

void quickSort(void)
{
int i;
printf("--------------------Unsorted------------------\n\n");
for(i = 0; i < 8; i++)
   printf("%d\n", OsThreads[i].priority);

qsort(my_array, 8, sizeof(my_struct), compfunc_int);

printf("---------------------Sorted------------------\n\n");
for(i = 0; i < 8; i++)
   printf("%d\n", OsThreads[i].priority);

}


int compfunc_int(const void *x, const void *y)
{
  //WHAT DOES THIS LINE DO??
 
  return ((my_struct *)x)->priority -((my_struct *)y)->priority;
}

[curiously enough]

Code removed per posting guidelines
       }

[sevak316]

thanks curiously enough.

i like my code to be simple!

[JosAH]

thanks curiously enough.

i like my code to be simple!

Then better stick to that qsort() method because a bubble sort method is one of
the worst sorting methods in existence.

kind regards,

Jos

[donbock]

The Standard Library provides a generic sort function (qsort). You should consider using it unless the point of your exercise is to demonstrate that you can implement a sort algorithm. To use qsort you need to write your own comparison function.

[Tassos Souris]

int compfunc_int(const void *x, const void *y){

   return ((my_struct *)x)->priority -((my_struct *)y)->priority;

}

See this equivalent:

int comparison( const void *_x, const void *_y ){

   my_struct *x = _x;  
   my_struct *y = _y;

   assert( x != NULL );
   assert( y != NULL );


   return ( x->priority - y->priority );

}

I think it is obvious now...