/* qsort example */
#include <stdio.h>      /* printf */
#include <stdlib.h>     /* qsort */

int values[] = { 40, 10, 100, 90, 20, 25 };

int compare (const void * a, const void * b)
{
  return ( *(int*)a - *(int*)b );
}

int compareDecreasing (const void * a, const void * b)
{
  return ( *(int*)b - *(int*)a );
}

int main ()
{
  int n;

  /* print out the values in the original order*/
  for (n=0; n<6; n++)
     printf ("%d ",values[n]);
  printf ("\n");

  /* sort in increasing order */
  qsort (values, 6, sizeof(int), compare);

  /* print out the values in increasing */
  for (n=0; n<6; n++)
     printf ("%d ",values[n]);
  printf ("\n");

  /* sort in decreasing order */
  qsort (values, 6, sizeof(int), compareDecreasing);

  /* print out the values in decreasing */
  for (n=0; n<6; n++)
     printf ("%d ",values[n]);
  printf ("\n");

  return 0;
}