Skip to main content

Exponential Search

Learn Exponential Search (Searching, Data Structures & Algorithms) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.

Finding a Range, Then Binary Searching It Exponential search is for searching a sorted array whose SIZE IS UNKNOWN (e.g. an unbounded/streamed array, or one accessed only through an iterator). It first finds a RANGE that must contain the target by doubling an index (1, 2, 4, 8, ...) until overshooting, then runs plain binary search within that bounded range.

More lessons in Searching