Binary Search

Binary Search is an efficient searching algorithm used to find a target value inside a sorted array. Instead of checking every element one by one like Linear Search, Binary Search repeatedly divides the search space in half until the target is found or the search range becomes empty.

Because it cuts the search area in half each step, Binary Search is much faster on large datasets.

How Binary Search Works

The algorithm follows these steps:

1. Find the middle element of the array.
2. Compare the middle element with the target value.
3. If the target matches the middle element, return the index.
4. If the target is smaller, continue searching the left half.
5. If the target is larger, continue searching the right half.
6. Repeat until the value is found or no elements remain.

Example Array

const numbers = [1, 3, 5, 7, 9, 11, 13, 15];

If we want to search for 11:

• Start in the middle (7)
• 11 is greater than 7
• Search the right half
• Middle becomes 11
• Value found

Binary Search in JavaScript

function binarySearch(arr, target) {
  let left = 0;
  let right = arr.length - 1;

  while (left <= right) {
    const middle = Math.floor((left + right) / 2);

    if (arr[middle] === target) {
      return middle;
    }

    if (arr[middle] < target) {
      left = middle + 1;
    } else {
      right = middle - 1;
    }
  }

  return -1;
}

const numbers = [1, 3, 5, 7, 9, 11, 13, 15];

console.log(binarySearch(numbers, 11)); // 5

Time Complexity

Binary Search is significantly faster than Linear Search for large sorted datasets.

Space Complexity

When to Use Binary Search

Binary Search is useful when:

• The data is already sorted
• Fast lookups are needed
• Working with large datasets
• Searching IDs, usernames, timestamps, or ordered values

Common Mistake

Binary Search only works correctly on sorted arrays.

This will produce incorrect results:

const numbers = [9, 1, 15, 3, 7];

Always sort the array first before using Binary Search.

Recursive Version

function recursiveBinarySearch(arr, target, left = 0, right = arr.length - 1) {
  if (left > right) {
    return -1;
  }

  const middle = Math.floor((left + right) / 2);

  if (arr[middle] === target) {
    return middle;
  }

  if (arr[middle] < target) {
    return recursiveBinarySearch(arr, target, middle + 1, right);
  }

  return recursiveBinarySearch(arr, target, left, middle - 1);
}

Final Thoughts

Binary Search is one of the most important algorithms in computer science and technical interviews. Understanding how it works helps build stronger problem-solving skills and introduces the concept of divide-and-conquer algorithms.

Once you understand Binary Search, it becomes easier to learn more advanced searching and tree-based algorithms.