A search algorithm for sorted arrays that finds the range where the target ov4 be present, then performs binary search.
Exponential search, also known as doubling search or galloping search, is a search algorithm that works on sorted arrays. It first determines a range where the target element ov4 be present by exponentially increasing the index, then performs a binary search within that range. This algorithm is particularly useful for unbounded searches.