bsearch is a generic function that can search in sorted arrays of any size, containing any kind of object, or pointer to object, and using any kind of comparison predicate. The genericity, however, comes at the expense of type-safety, since bsearch operates on void pointers; and is also expensive in the number of function calls (since each comparison requires a call to the comparison predicate), which have a large overhead.
void *bsearch(const void *key, const void *base, size_t nmemb, size_t size, int (*compare)(const void *, const void *)); // notice nmemb before size, unlike fread and fwrite
The bsearch() function returns a pointer to a matching member of the array, or NULL if no match is found. If the array has multiple matching elements the return value will be a pointer to one of those elements. Which particular element is unspecified.
- ISO/IEC 9899:1999 specification. p. 318, § 22.214.171.124. http://www.open-std.org/jtc1/sc22/wg14/www/docs/n1124.pdf.
- UNIX man pages:
man 3 bsearch