blob: 1c8b07fdb06b6b54db54e098000b5d4b979e8b7e (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
|
/*
* bsearch.c
*/
#include <stdlib.h>
void *bsearch(const void *key, const void *base, size_t nmemb,
size_t size, int (*cmp) (const void *, const void *))
{
while (nmemb) {
size_t mididx = nmemb / 2;
const void *midobj = base + mididx * size;
int diff = cmp(key, midobj);
if (diff == 0)
return (void *)midobj;
if (diff > 0) {
base = midobj + size;
nmemb -= mididx + 1;
} else
nmemb = mididx;
}
return NULL;
}
|
