qsort(3) [ultrix man page]

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)

PSORT(3)						   BSD Library Functions Manual 						  PSORT(3)

NAME

     psort, psort_b, psort_r -- parallel sort functions

SYNOPSIS

     #include <stdlib.h>

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

     void
     psort_b(void *base, size_t nel, size_t width, int (^compar)(const void *, const void *));

     void
     psort_r(void *base, size_t nel, size_t width, void *thunk, int (*compar)(void *, const void *, const void *));

DESCRIPTION

     The psort(), psort_b(), and psort_r() functions are parallel sort routines that are drop-in compatible with the corresponding qsort() func-
     tion (see qsort(3) for a description of the arguments).  On multiprocessor machines, multiple threads may be created to simultaneously per-
     form the sort calculations, resulting in an overall faster sort result.  Overhead in managing the threads limits the maximum speed improve-
     ment to somewhat less that the number of processors available.  For example, on a 4-processor machine, a typical sort on a large array might
     result in 3.2 times faster sorting than a regular qsort().

RESTRICTIONS

     Because of the multi-threaded nature of the sort, the comparison function is expected to perform its own synchronization that might be
     required for data physically outside the two objects passed to the comparison function.  However, no synchronization is required for the two
     object themselves, unless some third party is also accessing those objects.

     Additional memory is temporary allocated to deal with the parallel nature of the computation.

     Because of the overhead of maintaining multiple threads, the psort() family of routines may choose to just call qsort(3) when there is no
     advantage to parallelizing (for example, when the number of objects in the array is too small, or only one processor is available).

     Like qsort(3), the sort is not stable.

RETURN VALUES

     The psort(), psort_b() and psort_r() functions return no value.

SEE ALSO

     qsort(3)

Mac OS X							   Nov 25, 2008 							  Mac OS X