QSORT(3)QSORT(3)NAMEqsort - quicker sort
SYNOPSIS
#include <stdlib.h>
void
qsort(void *base, size_t nmemb, size_t size,
int (*compar)(const void *, const void *));
DESCRIPTION
Qsort is an implementation of C.A.R. Hoare's ``quicksort'' algorithm.
The qsort function sorts an array of nmemb objects, the initial member
of which is pointed to by base. The size of each object is specified
by size.
The contents of the array are sorted in ascending order according to a
comparison function pointed to by compar, which is called with two
arguments that point to the objects being compared.
The comparison function must return an integer less than, equal to, or
greater than zero if the first argument is considered to be respecā
tively less than, equal to, or greater than the second.
If two members compare as equal, their order in the sorted array is
undefined.
SEE ALSOsort(1)STANDARDS
Qsort conforms to ANSI X3.159-1989 (``ANSI C'').
BUGS
The comparison routine may not itself call qsort(3).
4th Berkeley Distribution May 16, 1990 QSORT(3)