binarySearch

binarySearch

Following is sample javascript code.

function binarySearch(arr, findElm){
  let start =0;
  let end = arr.length -1
  let middle = Math.floor((start+end)/2);
  
  while(findElm !== arr[middle] && start<=end) {
    if(arr[middle] < findElm) {
       start = middle + 1
    } else {
      end = middle - 1
    }
    middle = Math.floor((start+end)/2);
  }
  
  return arr[middle] === findElm ? middle : -1;
}

console.log(binarySearch([1,2,3,6,8,9], 8))