ref: 4b517d27848e1ce19207cf3c3ad95d68b1882ed5
dir: /lib/c/bsearch.c/
#include <stdlib.h> void * bsearch(const void *key, const void *ary, size_t n, size_t size, int (*cmp)(const void *, const void *)) { int t; size_t mid, low, high; const char *cur, *base = ary; low = 0; high = n - 1; while (low <= high) { mid = low + (high - low) / 2; cur = base + mid*size; if ((t = (*cmp)(key, cur)) == 0) return (void *) cur; else if (t > 0) low = mid + 1; else high = mid - 1; } return NULL; }