1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
.\" Copyright 1993 David Metcalfe (david@prism.demon.co.uk)
.\"
.\" Permission is granted to make and distribute verbatim copies of this
.\" manual provided the copyright notice and this permission notice are
.\" preserved on all copies.
.\"
.\" Permission is granted to copy and distribute modified versions of this
.\" manual under the conditions for verbatim copying, provided that the
.\" entire resulting derived work is distributed under the terms of a
.\" permission notice identical to this one
.\"
.\" Since the Linux kernel and libraries are constantly changing, this
.\" manual page may be incorrect or out-of-date. The author(s) assume no
.\" responsibility for errors or omissions, or for damages resulting from
.\" the use of the information contained herein. The author(s) may not
.\" have taken the same level of care in the production of this manual,
.\" which is licensed free of charge, as they might when working
.\" professionally.
.\"
.\" Formatted or processed versions of this manual, if unaccompanied by
.\" the source, must acknowledge the copyright and authors of this work.
.\"
.\" References consulted:
.\" Linux libc source code
.\" Lewine's _POSIX Programmer's Guide_ (O'Reilly & Associates, 1991)
.\" 386BSD man pages
.\" Modified Mon Mar 29 22:47:58 1993, David Metcalfe
.\" Modified Sat Jul 24 18:41:27 1993, Rik Faith (faith@cs.unc.edu)
.\"
.\" Traduction 05/11/1996 par Christophe Blaess (ccb@club-internet.fr)
.\"
.TH QSORT 3 "5 Novembre 1996" GNU "Manuel du programmeur Linux"
.SH NOM
qsort \- Trier une table.
.SH SYNOPSIS
.nf
.B #include <stdlib.h>
.sp
.BI "void qsort (void *" base ", size_t " nmemb ", size_t " size ,
.RS
.BI "int (*" compar ")(const void *, const void *));"
.fi
.SH DESCRIPTION
La fonction \fBqsort()\fP trie une table contenant \fInmemb\fP lments de
taille \fIsize\fP. L'argument \fIbase\fP pointe sur le dbut de la table.
.PP
Le contenu de la table est tri en ordre croissant, en utilisant la fonction
de comparaison pointe par \fIcompar\fP, laquelle est appele avec deux
arguments pointant sur les objets comparer.
.PP
La fonction de comparaison doit renvoyer un entier infrieur, gal, ou suprieur
zro si le premier argument est respectivement considre comme infrieur,
gal ou suprieur au second. Si la comparaison des deux arguments renvoie
une galite (valeur de retour nulle), l'ordre des deux lments est indfini.
.SH "VALEUR RENVOYE"
La fonction \fBqsort()\fP ne renvoie pas de valeur.
.SH "CONFORMIT"
SVID 3, POSIX, BSD 4.3, ISO 9899
.SH "VOIR AUSSI"
.BR sort (1)
.SH TRADUCTION
Christophe Blaess, 1997.
|
