 In analyzing the performance of binary search, another consideration is the time required to compare two elements.For integers and strings, the time required increases linearly as the encoding length (usually the number of bits) of the elements increase.For example, comparing a pair of 64-bit unsigned integers would require comparing up to double the bits as comparing a pair of 32-bit unsigned integers.