Explicateur de Code IA & Analyseur de Complexité Big-O

Décomposition Logique du Code

• Tekil döngü ile doğrusal veri taraması gerçekleştirilmektedir.

Analyze the following algorithm for runtime and memory efficiency.
Explain each logical phase, verify edge-case robustness (empty collections, overflow, boundary values), and provide an optimized, production-grade refactored version with TypeScript types:

```typescript
function binarySearch(arr: number[], target: number): number {
  let left = 0;
  let right = arr.length - 1;

  while (left <= right) {
    const mid = Math.floor((left + right) / 2);
    if (arr[mid] === target) return mid;
    if (arr[mid] < target) left = mid + 1;
    else right = mid - 1;
  }
  return -1;
}
```