.\" Copyright (c) 1990 The Regents of the University of California.
.\" %sccs.include.redist.man%
.\" @(#)qsort.3 6.3 (Berkeley) %G%
qsort(void *base, size_t nmemb, size_t size,
int (*compar)(const void *, const void *));
is an implementation of C.A.R. Hoare's ``quicksort'' algorithm.
function sorts an array of
objects, the initial member of which is pointed to by
The size of each object is specified by
The contents of the array are sorted in ascending order according to
a comparison function pointed to by
which is called with two arguments that point to the objects being
The comparison function must return an integer less than, equal to, or
greater than zero if the first argument is considered to be respectively
less than, equal to, or greater than the second.
If two members compare as equal, their order in the sorted array is
conforms to ANSI X3.159-1989 (``ANSI C'').
The comparison routine may not itself call