 Uniform binary search stores, instead of the lower and upper bounds, the difference in the index of the middle element from the current iteration to the next iteration.A lookup table containing the differences is computed beforehand.For example, if the array to be searched is , the middle element (formula_17) would be .