/* simple qsort demo */

#include <stdio.h>
#include <stdlib.h>

int comp( const void *p1, const void *p2 ); /* function to compare for qsort */

main()
{
	 int i, n, a[10];
	 n = sizeof( a ) / sizeof( a[ 0 ] );

	 for( i = 0; i < n; i++ )
	    a[ i ] = rand() % 100;	 /* fill with random number 0 - 99 */

	 printf( "Before sorting...\n" );
	 for( i = 0; i < n; i++ )
	    printf( "%5d%5d\n", i, a[ i ] );

	 qsort( a,                      /* address of array to be sorted */
	        n,                      /* number of elements in array */
	        sizeof( a[0] ), 	/* size of an element */
	        comp );             	/* function to compare */

	 printf( "After sorting...\n" );
	 for( i = 0; i < n; i++ )
	    printf( "%5d%5d\n", i, a[ i ] );

	 return( 0 );
}

int comp( const void *p1, const void *p2 )
{
	 return( *(int *)p1 - *(int *)p2 );
}