Run results for: Binary Search vs Array.prototype.indexOf

Run details:

User agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/136.0.0.0 Safari/537.36

Browser: Chrome 136

Operating system: Windows

Device Platform: Desktop

Date tested: 11 months ago

Test name	Executions per second
indexOf 1000	277798.9 Ops/sec
indexOf 100000	1364.2 Ops/sec
indexOf 1000000	117.9 Ops/sec
binSearch 1000	258898.0 Ops/sec
binSearch 100000	1316.0 Ops/sec
binSearch 1000000	120.8 Ops/sec

HTML Preparation code:

<!--your preparation HTML code goes here-->

Script Preparation code:

function createLargeList(n) {
  const arr = [];
  for (i=0;i<n;i++) {
    arr.push(i);
  }
  return arr;
}

function indexOf(arr, v) {
  return arr.indexOf(v);
}

function binSearch(arr, v) {
  if (arr.length === 0) return -1;

  let left = 0;
  let right = arr.length - 1;

  while (left <= right) {
    let mid = Math.floor((left + right) / 2);
    if (arr[mid] === v) {
      return mid;
    } else if (v < arr[mid]) {
      right = mid - 1;
    } else {
      left = mid + 1;
    }
  }

  return -1;
}

Tests:

indexOf 1000
const l = 1000; const arr = createLargeList(l); const r = Math.floor(Math.random() * l); const x = indexOf(arr, r);
indexOf 100000
const l = 100000; const arr = createLargeList(l); const r = Math.floor(Math.random() * l); const x = indexOf(arr, r);
indexOf 1000000
const l = 1000000; const arr = createLargeList(l); const r = Math.floor(Math.random() * l); const x = indexOf(arr, r);
binSearch 1000
const l = 1000; const arr = createLargeList(l); const r = Math.floor(Math.random() * l); const x = binSearch(arr, r);
binSearch 100000
const l = 100000; const arr = createLargeList(l); const r = Math.floor(Math.random() * l); const x = binSearch(arr, r);
binSearch 1000000
const l = 1000000; const arr = createLargeList(l); const r = Math.floor(Math.random() * l); const x = binSearch(arr, r);

Run results for: Binary Search vs Array.prototype.indexOf

I'm just wondering if it is optimized under the hood.

indexOf 1000

indexOf 100000

indexOf 1000000

binSearch 1000

binSearch 100000

binSearch 1000000