JavaScript:实现ExponentialSearch指数搜索算法（附完整源码）

/**
 *
 * The algorithm consists of two stages. The first stage determines a
 * range in which the search key would reside if it were in the list.
 * In the second stage, a binary search is performed on this range.
 *
 *
 *
 */

function binarySearch (arr, value, floor, ceiling) {
   
  // Middle index
  const mid = Math.
1
2
3
4
5
6
7
8
9
10
11
12
13