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

.TH QSORT 3  "19 January 1983"
.UC 4
.SH NAME
qsort \- quicker sort
.SH SYNOPSIS
.nf
.B qsort(base, nel, width, compar)
.B char *base;
.B int (*compar)();
.fi
.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
f132d4ec C	1	.TH QSORT 3 "19 January 1983"
	2	.UC 4
	3	.SH NAME
	4	qsort \- quicker sort
	5	.SH SYNOPSIS
	6	.nf
	7	.B qsort(base, nel, width, compar)
	8	.B char *base;
	9	.B int (*compar)();
	10	.fi
	11	.SH DESCRIPTION
	12	.I Qsort
	13	is an implementation 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 in bytes;
	17	the last is the name of the comparison routine
	18	to be called with two arguments which are pointers
	19	to the elements being compared.
	20	The routine must return an integer less than, equal to, or greater than 0
	21	according as the first argument is to be considered
	22	less than, equal to, or greater than the second.
	23	.SH "SEE ALSO"
	24	sort(1)