std::bsearch

Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">

<td>

Defined in header <cstdlib>

</td>

<td></td> <td></td> </tr> <tr class="t-dcl ">

<td class="t-dcl-nopad">

void *bsearch( const void *key, const void *ptr, size_t count, size_t size,
               int (*comp)(const void *, const void *) );

</td>

<td class="t-dcl-nopad"> </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end

Finds an element equal to element pointed to by key in an array pointed to by ptr. The array contains count elements of size size. Function pointed to by comp is used for object comparison.

key	-	pointer to the element to search for
ptr	-	pointer to the array to examine
count	-	number of element in the array
size	-	size of each element in the array in bytes
comp	-	comparison function which returns ​a negative integer value if the first argument is less than the second, a positive integer value if the first argument is greater than the second and zero if the arguments are equivalent. key is passed as the first argument, an element from the array as the second. The signature of the comparison function should be equivalent to the following:  int cmp(const void *a, const void *b); The function must not modify the objects passed to it and must return consistent results when called for the same objects, regardless of their positions in the array. ​

Template:returns pointer to the found element or Template:cpp otherwise.

Template:example cpp Template:cpp/algorithm/dcl list qsortTemplate:cpp/algorithm/dcl list equal range