Searching Algorithms (linear search, binary search)

What is the main purpose of this searching technique?

function exponentialSearch(arr, target) {
  if(arr[0] === target) return 0;
  let i = 1;
  while(i < arr.length && arr[i] <= target) i *= 2;
  return binarySearch(arr, target, i/2, Math.min(i, arr.length-1));
}

Finding exact matches only
Searching in infinite arrays
Exponential search is designed for: 1) Efficient searching in unbounded/infinite arrays, 2) Finding range before binary search, 3) Doubles search range each iteration, 4) Combines benefits of binary search, 5) O(log n) complexity when target near beginning, 6) Better than binary search for unbounded arrays, 7) Useful in streaming data scenarios, 8) Efficient for unknown array sizes.
Improving search in bounded arrays
Handling unsorted data

Next Question (9/24)