1QSORT(3)                   Library Functions Manual                   QSORT(3)
2
3
4

NAME

6       qsort - quicker sort
7

SYNOPSIS

9       qsort(base, nel, width, compar)
10       char *base;
11       int (*compar)( );
12

DESCRIPTION

14       Qsort  is  an  implementation of the quicker-sort algorithm.  The first
15       argument is a pointer to the base of the data; the second is the number
16       of elements; the third is the width of an element in bytes; the last is
17       the name of the comparison routine to  be  called  with  two  arguments
18       which  are  pointers  to the elements being compared.  The routine must
19       return an integer less than, equal to, or greater than 0  according  as
20       the  first argument is to be considered less than, equal to, or greater
21       than the second.
22

SEE ALSO

24       sort(1)
25
26
27
28                                                                      QSORT(3)
Impressum