bsearch

10,000+ views

GPL — licence
Edit / fork this page
Contents
  1. NAME
  2. INTERFACE
  3. DESCRIPTION
  4. RETURN VALUES
  5. SEE ALSO
  6. STANDARDS

binary search of a sorted table

You're viewing an older version of this page (#3235). View the current version.

Computing C Stdlib.h

View versions (3)

NAME

<span class="Nm" id="bsearch">bsearch</span>

INTERFACE

#include <stdlib.h> void bsearch ( const void *key, const void *base, size_t nmemb, size_t size, int (*compar) (const void *, const void *) )

DESCRIPTION

The bsearch function searches an array of &#92;c nmemb objects, the initial member of which is pointed to by &#92;c base, for a member that matches the object pointed to by &#92;c key. The size of each member of the array is specified by &#92;c size. &#92;n &#92;n The contents of the array should be in ascending sorted order according to the comparison function referenced by &#92;c compar. The &#92;c compar routine is expected to have two arguments which point to the &#92;c 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 &#92;c key object is found, respectively, to be less than, to match, or be greater than the array member.

RETURN VALUES

The bsearch 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.

SEE ALSO

reference:db (3) , lsearch (3) , qsort (3)

STANDARDS

The bsearch function conforms to