qsort(3C)                                                         qsort(3C)

NAME
     qsort - sort using quicksort

SYNOPSIS
     #include <stdlib.h>

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

DESCRIPTION
     qsort() is an implementation of the quicksort algorithm. It sorts a
     table of data in place. The contents of the table are sorted in
     ascending order according to the user-supplied comparison function.
     base points to the element at the base of the table. nel is the number
     of elements in the table. width specifies the size of each element in
     bytes. compar is the name of the user-defined comparison function,
     which is called by qsort() with two arguments that point to the ele-
     ments being compared. This function must return an integer less than,
     equal to, or greater than zero to indicate if the first argument is to
     be considered less than, equal to, or greater than the second.

NOTES
     If two elements are the same according to this function, their
     sequence in the sorted table will be unpredictable.

SEE ALSO
     sort(1), bsearch(3C), lsearch(3C), string(3C).




























Page 1                       Reliant UNIX 5.44                Printed 11/98