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
64
65
|
.\" 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:41:16 1993, David Metcalfe
.\" Modified Sat Jul 24 21:35:16 1993, Rik Faith (faith@cs.unc.edu)
.\"
.\" Traducido al castellano (con permiso) por:
.\" Sebastian Desimone (chipy@argenet.com.ar) (desimone@fasta.edu.ar)
.\" Traduccin revisada 18 May 1998 por Juan Pablo Puerta <jppuerta@full-moon.com>
.\"
.TH BSEARCH 3 "23 Diciembre 1995" "GNU" "Manual del Programador de Linux"
.SH NOMBRE
bsearch \- bsqueda binaria en un arreglo (array) ordenado
.SH SINOPSIS
.nf
.B #include <stdlib.h>
.sp
.BI "void *bsearch(const void *" key ", const void *" base ", size_t " nmemb ,
.RS
.BI "size_t " size ", int (*" compar ")(const void *, const void *));
.RE
.fi
.SH DESCRIPCIN
La funcin \fBbsearch()\fP busca en un arreglo de \fInmemb\fP elementos,
donde el primer elemento est apuntado por \fIbase\fP, un elemento
que coincida con el objecto apuntado por \fIkey\fP. El tamao de cada
elementos del arreglo es especificado por \fIsize\fP.
.PP
El contenido del arreglo debe estar ordenado en orden ascendente segn
la funcin de comparacin referenciada por \fIcompar\fP. Se espera que la
rutina \fIcompar\fP tenga dos argumentos que apunten al objeto \fIkey\fP
y a un elemento del arreglo, en ese orden, y debe devolver un entero menor,
igual o mayor que cero si resulta que el objeto \fIkey\fP es
menor, igual o mayor (respectivamente) que el elemento del arreglo.
.SH "VALOR DEVUELTO"
La funcin \fBbsearch()\fP devuelve un puntero al elemento del arreglo que
coincide, o NULL si no hay coincidencia. Si hay mltiples elementos que
coinciden con la clave, el elemento devuelto est sin determinar.
.SH "CONFORME A"
SVID 3, BSD 4.3, ISO 9899
.SH "VASE TAMBIN"
.BR qsort (3)
|
