 This method will only work if calculations on the size of differences between key values are sensible.By comparison, binary search always chooses the middle of the remaining search space, discarding one half or the other, depending on the comparison between the key found at the estimated position and the key sought — it does not require numerical values for the keys, just a total order on them.The remaining search space is reduced to the part before or after the estimated position.