Benchmark: Binary Search vs Array.prototype.indexOf

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);

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
indexOf 1000
indexOf 100000
indexOf 1000000
binSearch 1000
binSearch 100000
binSearch 1000000

Fastest: N/A

Slowest: N/A

Latest run results:

Run details: (Test run date: one year ago)

User agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:140.0) Gecko/20100101 Firefox/140.0

Browser/OS: Firefox 140 on Windows

View result in a separate tab

indexOf 1000

62K/s

binSearch 1000

7K/s

indexOf 100000

62/s

binSearch 100000

61/s

binSearch 1000000

6/s

indexOf 1000000

6/s

View exact numbers

Test name	Executions per second
✓ indexOf 1000	61,781 Ops/sec
binSearch 1000	6,537 Ops/sec
indexOf 100000	62 Ops/sec
binSearch 100000	61 Ops/sec
binSearch 1000000	6 Ops/sec
indexOf 1000000	6 Ops/sec

Binary Search vs Array.prototype.indexOf (version: 1)

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

Comparing performance of: `indexOf 1000 vs indexOf 100000 vs indexOf 1000000 vs binSearch 1000 vs binSearch 100000 vs binSearch 1000000`

Created: one year ago by: Registered User

Go to the latest result

indexOf 1000

indexOf 100000

indexOf 1000000

binSearch 1000

binSearch 100000

binSearch 1000000

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A

Binary Search vs Array.prototype.indexOf (version: 1)

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

Comparing performance of: indexOf 1000 vs indexOf 100000 vs indexOf 1000000 vs binSearch 1000 vs binSearch 100000 vs binSearch 1000000

Created: one year ago by: Registered User

Go to the latest result

indexOf 1000

indexOf 100000

indexOf 1000000

binSearch 1000

binSearch 100000

binSearch 1000000

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A

Related benchmarks

Comparing performance of: `indexOf 1000 vs indexOf 100000 vs indexOf 1000000 vs binSearch 1000 vs binSearch 100000 vs binSearch 1000000`