Binary Search Algorithm

Efficient O(log n) search algorithm for sorted arrays. Returns the index of the target element or -1 if not found.

JavaScript7/16/2025

#algorithms#search#performance

JavaScript

function binarySearch(arr, target) {
  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;
}

...

Loading comments...