View Source: bsearch(3) - Waikato Linux Users Group

Edit PageHistory Diff Info LikePages

BSEARCH
!!!BSEARCH
NAME
SYNOPSIS
DESCRIPTION
RETURN VALUE
CONFORMING TO
SEE ALSO
----
!!NAME


bsearch - binary search of a sorted array.
!!SYNOPSIS


__#include
__''key''__, const void *__''base''__, size_t__ ''nmemb''__,
size_t__ ''size''__, int (*__''compar''__)(const void *, const void *));
__
!!DESCRIPTION


The __bsearch()__ function searches an array of
''nmemb'' objects, the initial member of which is pointed
to by ''base'', for a member that matches the object
pointed to by ''key''. The size of each member of the
array is specified by ''size''.


The contents of the array should be in ascending sorted
order according to the comparison function referenced by
''compar''. The ''compar'' routine is expected to have
two arguments which point to the ''key'' object and to an
array member, in that order, and should return an integer
less than, equal to, or greater than zero if the ''key''
object is found, respectively, to be less than, to match, or
be greater than the array member.
!!RETURN VALUE


The __bsearch()__ function returns a pointer to a
matching member of the array, or NULL if no match is found.
If there are multiple elements that match the key, the
element returned is unspecified.
!!CONFORMING TO


SVID 3, BSD 4.3, ISO 9899
!!SEE ALSO


qsort(3)
----

10 pages link to bsearch(3):

This page is a man page (or other imported legacy content). We are unable to automatically determine the license status of this page.

Last edited on Tuesday, June 4, 2002 12:24:12 am by "perry"

Edit PageHistory Diff Info LikePages