Binary Search

Binary search implementation over sorted arrays.

O(log n)

Medium confidence

Last analyzed Sep 2, 2025

TypeScript

Algorithms

Authored by Avery Johnson*Jul 4, 2025

Code

TYPESCRIPTSnippet preview

1export function binarySearch(arr: number[], target: number) {
2  let left = 0;
3  let right = arr.length - 1;
4
5  while (left <= right) {
6    const mid = Math.floor((left + right) / 2);
7    if (arr[mid] === target) {
8      return mid;
9    }
10    if (arr[mid] < target) {
11      left = mid + 1;
12    } else {
13      right = mid - 1;
14    }
15  }
16
17  return -1;
18}

Loading snippet preview...

Complexity explanation

Loop or recursion dividing work roughly in half each step.

Signals detected

Nested loops depth 2
Divide-and-conquer pattern

Related snippets

TypeScript*Casey Liu

Kadane's Algorithm

Maximum subarray sum using Kadane's approach.