#adaptive-search
Wiki
›
Algorithms
›
01. Searching and Sorting
›
12. Specialized Search and Sorted-Order Procedures
›
Exponential Backoff Search
Exponential Backoff Search Exponential backoff search finds a target in a sorted or monotone structure by expanding the search interval geometrically. Instead of scanning linearly, it probes positions at increasing distances until it either finds the target or bounds it inside an interval. A secondary search then refines the result. This method is useful when the size of the data is unknown, unbounded, or expensive to traverse fully. Problem Given...