تقليل مساحة البحث بالنصف بإستخدام Binary Search

function binarySearch(items, target) {
  let left = 0;
  let right = items.length - 1;
  while (left <= right) {
    const middle = Math.floor((left + right) / 2);
    if (items[middle] === target) return middle;
    if (items[middle] < target) left = middle + 1;
    else right = middle - 1;
  }
  return -1;
}
console.log(binarySearch([3, 7, 12, 18, 25], 18));
console.log(binarySearch([3, 7, 12, 18, 25], 8));

3
-1