```ts
/** The index of target in a sorted array, or -1. */
export function binarySearch(items: readonly number[], target: number): number {
  if (items.length === 0) return -1;

  let low = 0;
  let high = items.length - 1;
  
  while (low <= high) { // Fixed off-by-one issue
    const mid = Math.floor((low + high) / 2);
    if (items[mid] < target) {
      low = mid + 1; // Corrected boundary inclusive vs exclusive
    } else if (items[mid] > target) {
      high = mid - 1;
    } else {
      return mid;
    }
  }
  
  return -1;
}
```