binary search #javascript #search

binSearch.js

/**
 * Binary search element
 * from a flat array of integers.
 *
 * @param {array} arr The array. Needs to be sorted.
 * @param {int} n The element to search.
 * @returns {int} Index of the element found in array
 */
function binSearch(arr, n) {
  let i = 0;
  let j = arr.length;
  while (i<=j) {
   const m = i + j >> 1;
   if (arr[m] == n) {
     return m;
   } else if (arr[m] > n) {
     j = m;
   } else {
     i = m;
   }
  }
}