|
|
1.1 root 1: .TH QSORT 3
2: .CT 2 data_man
3: .SH NAME
4: qsort \(mi 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: (quicker sort)
14: sorts an array into nondecreasing order.
15: The first argument is a pointer to the base of the data;
16: the second is the number of elements;
17: the third is the width of an element
18: in bytes;
19: the last is the name of a comparison routine
20: to be called with pointers
21: to elements being compared.
22: It should be declared as
23: .EX
24: compar(a, b)
25: char *a, *b;
26: .EE
27: The routine must return
28: an integer less than, equal to, or greater than 0
29: according as the first argument is to be considered
30: less than, equal to, or greater than the second.
31: .SH "SEE ALSO"
32: .IR sort (1)
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.