QSORT(3C)            INTERACTIVE UNIX System            QSORT(3C)



          NAME
               qsort - quicker sort

          SYNOPSIS
               void qsort ((char *) base, nel, sizeof (*base), compar)
               unsigned nel;
               int (*compar)( );

          DESCRIPTION
               The qsort function is an implementation of the quicker-sort
               algorithm.  It sorts a table of data in place.

               Base points to the element at the base of the table.  Nel is
               the number of elements in the table.  Compar is the name of
               the comparison function, which is called with two arguments
               that point to the elements being compared.  The comparison
               function must return an integer less than, equal to, or
               greater than zero, according to whether the first argument
               is to be considered as less than, equal to, or greater than
               the second argument.

          SEE ALSO
               bsearch(3C), lsearch(3C), string(3C).
               sort(1) in the INTERACTIVE UNIX System User's/System
               Administrator's Reference Manual.

          NOTES
               The pointer to the base of the table should be of type
               pointer-to-element, and cast to type pointer-to-character.
               The comparison function need not compare every byte, so
               arbitrary data may be contained in the elements in addition
               to the values being compared.
               The order in the output of two items which compare as equal
               is unpredictable.





















          Rev. C Software Development Set                            Page 1