search

Benchmark created on March 18, 2025

Setup

function getRandomInt(min, max) {
  min = Math.ceil(min);
  max = Math.floor(max);
  return Math.floor(Math.random() * (max - min + 1)) + min;
}

function binarySearch(arr, target) {
  let low = 0;
  let high = arr.length - 1;

  while (low <= high) {
    const mid = Math.floor((low + high) / 2);

    if (arr[mid] === target) {
      return mid;
    } else if (arr[mid] < target) {
      low = mid + 1;
    } else {
      high = mid - 1;
    }
  }

  return -1; // Target not found
}

const MAX = 10_000_000;
const array = new Array(MAX).keys().toArray();

const x = getRandomInt(0, MAX);
const y = getRandomInt(0, MAX);
const int = getRandomInt(Math.min(x, y), Math.max(x, y))

Test runner

array.find(n => n === int);

for (let i = 0; i < array.length; i++) {
	if (array[i] === int) {
		break;
	}
}

binarySearch(array, int);

Revisions

You can edit these tests or add more tests to this page by appending /edit to the URL.

• Revision 1: published on March 18, 2025