 By dividing the array in half, binary search ensures that the size of both subarrays are as similar as possible.Binary search requires three pointers to elements, which may be array indices or pointers to memory locations, regardless of the size of the array.However, it requires at least formula_113 bits to encode a pointer to an element of an array with formula_2 elements.