binarySearch

by Krishna Ananthi

JavaScript

/**search a element inside array
 */

function binarySearch(a, x) {
  let start = 0;
  let end = a.length;
  while (start < end) {
    let mid = Math.floor((start + end) / 2);
     if(a[mid] === x) {
      return mid+1;
    }
    if (a[mid] > x) {
      end = mid - 1;
    } else if (a[mid] < x) {
      start = mid + 1;
    }
  }
  return -1;
}

console.log(binarySearch([1,2,3,4,5,6,7,8,9,10],7))