Skip to main content

Exponential Search

Finds a range by doubling the index, then performs binary search within that range. Ideal for unbounded or infinite sorted arrays.

Interactive Visualization

Loading visualization…

Usage

import { exponentialSearch } from 'athro';

const arr = [2, 4, 8, 16, 32, 64, 128];
const index = exponentialSearch(arr, 32);

Time Complexity

CaseTime ComplexityDescription
BestO(1)Target at index 0
AverageO(log n)Range finding + binary search
WorstO(log n)Target at end of array