```ts
export function binarySearch(items: readonly number[], target: number): number {
  if (items.length === 0) return -1; // Fix for empty array

  let low = 0;
  let high = items.length - 1;

  while (low <= high) { // Adjusted to include the upper bound
    const mid = Math.floor((low + high) / 2);
    if (items[mid] === target) {
      return mid;
    }
    if (items[mid] < target) {
      low = mid + 1;
    } else {
      high = mid - 1;
    }
  }

  return -1; // No more entries and not found
}
```