Fast and slow (?) bsearch

bsearch.c

static uint32_t *
fast_bsearch_u32(uint32_t *base, size_t nmemb, uint32_t key) {
    while (nmemb) {
        size_t half = nmemb >> 1;
        if (base[half] < key) {
            base += nmemb - half;
        }
        nmemb = half;
    }
    return base;
}

static uint32_t *
slow_bsearch_u32(uint32_t *base, size_t nmemb, uint32_t key) {
    while (nmemb) {
        size_t half = nmemb >> 1;
        if (base[half] < key) {
            base += half + 1;
            nmemb -= half + 1;
        } else {
            nmemb = half;
        }
    }
    return base;
}