[unix-history] / usr / man / man3 / qsort.3

.TH QSORT 3 
.SH NAME
qsort \- quicker sort
.SH SYNOPSIS
.B qsort(base, nel, width, compar)
.br
.B char *base;
.br
.B int (*compar)( );
.SH DESCRIPTION
.I Qsort
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.
.SH "SEE ALSO"
sort(1)
Commit	Line	Data
e6817382 BJ	1	.TH QSORT 3
	2	.SH NAME
	3	qsort \- quicker sort
	4	.SH SYNOPSIS
	5	.B qsort(base, nel, width, compar)
	6	.br
	7	.B char *base;
	8	.br
	9	.B int (*compar)( );
	10	.SH DESCRIPTION
	11	.I Qsort
	12	is an implementation
	13	of the quicker-sort algorithm.
	14	The first argument is a pointer to the base of the data;
	15	the second is the number of elements;
	16	the third is the width of an element
	17	in bytes;
	18	the last is the name of the comparison routine
	19	to be called with two arguments which are pointers
	20	to the elements being compared.
	21	The routine must return
	22	an integer less than, equal to, or greater than 0
	23	according as the first argument is to be considered
	24	less than, equal to, or greater than the second.
	25	.SH "SEE ALSO"
	26	sort(1)