// Binary Search Implementation in JavaScript

/**
 * Performs binary search on a sorted array
 * @param {number[]} arr - Sorted array to search in
 * @param {number} target - Element to find
 * @returns {number} Index of target if found, else -1
 */
function binarySearch(arr, target) {
  let left = 0;
  let right = arr.length - 1;

  // Continue searching while left <= right
  while (left <= right) {
    // Find the middle index
    let mid = Math.floor((left + right) / 2);

    // Check if middle element is the target
    if (arr[mid] === target) {
      return mid; // Found the target
    }
    // If target is smaller, ignore right half
    else if (arr[mid] > target) {
      right = mid - 1;
    }
    // If target is larger, ignore left half
    else {
      left = mid + 1;
    }
  }

  // If not found
  return -1;
}

// Example usage:
const numbers = [2, 5, 8, 12, 16, 23, 38, 56, 72, 91];
const target = 23;

const result = binarySearch(numbers, target);

// Display result
if (result !== -1) {
  console.log(`Element ${target} found at index ${result}`);
} else {
  console.log(`Element ${target} not found in the array`);
}