 Uniform binary search may be faster on systems where it is inefficient to calculate the midpoint, such as on decimal computers.Exponential search extends binary search to unbounded lists.It starts by finding the first element with an index that is both a power of two and greater than the target value.