Searching AlgorithmsExponential Search
Exponential Search
Doubles a range bound until it passes the target, then binary-searches that range — great for unbounded lists.
Intermediatesorted requiredunboundedO(log n)
Loading visualization…
Doubles a range bound until it passes the target, then binary-searches that range — great for unbounded lists.