Exponential Search finds a range where the target might exist by exponentially increasing the index (doubling it) until it overshoots, then performs a binary search within that range. It’s particularly useful for unbounded searches or when the target is near the start.
Combines exponential search with binary search
Finds a range that the target might exist (exponential).
Performs binary search to locate the target (binary)
Efficient on sorted arrays when the target is near the beginning.