Uniform binary search
Uniform binary search is an optimization of the classic binary search algorithm invented by Donald Knuth and given in Knuth's The Art of Computer Programming. It uses a lookup table to update a single array index, rather than taking the midpoint of an upper and a lower bound on each iteration; therefore, it is optimized for architectures on which
The uniform binary search algorithm looks like this, when implemented in C.
- define LOG_N 4
static int delta;
void make_delta
int unisearch
/* Example of use: */
- define N 10
int main
