e/Uniform binary search

Information
has gloss	eng: Uniform binary search is an optimization of the classic binary search algorithm invented by Donald Knuth and given in Knuths 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 (such as Knuths MIX) on which
lexicalization	eng: Uniform binary search
instance of	e/Search algorithm