.\" Copyright (c) 1990, 1991, 1993
.\" The Regents of the University of California. All rights reserved.
.\" This code is derived from software contributed to Berkeley by
.\" the American National Standards Committee X3, on Information
.\" %sccs.include.redist.man%
.\" @(#)bsearch.3 8.2 (Berkeley) %G%
.Nd binary search of a sorted table
.Fn bsearch "const void *key" "const void *base" "size_t nmemb" "size_t size" "int (*compar) (const void *, const void *)"
function searches an array of
objects, the inital member of which is
for a member that matches the object pointed to by
The size of each member of the array is specified by
The contents of the array should be in ascending sorted order according
to the comparison function referenced by
two arguments which point to the
object and to an array member, in that order, and should return an integer
less than, equal to, or greater than zero if the
object is found, respectively, to be less than, to match, or be
greater than the array member.
function returns a pointer to a matching member of the array, or a null
pointer if no match is found.
If two members compare as equal, which member is matched is unspecified.