ultrix man page for qsort

qsort(3)						     Library Functions Manual							  qsort(3)

Name
       qsort - quicker sort

Syntax
       #include <stdlib.h>

       void qsort(base, nel, width, compar)
       void *base;
       size_t nel, width;
       int (*compar)();

Description
       The  subroutine is an implementation of the quicker-sort algorithm.  The first argument is a pointer to the base of the data; the second is
       the number of elements; the third is the width of an element in bytes; the last is the name of the comparison routine to be called with two
       arguments  which  are  pointers	to the elements being compared.  The routine must return an integer less than, equal to, or greater than 0
       according as the first argument is to be considered less than, equal to, or greater than the second.

See Also
       sort(1)

																	  qsort(3)