A simple binary search algorithm

binarySearch.js

/*

time: O(log n)
space: O(1)

*/

function binarySearch(value, array) {
  let start = 0
  let end = array.length
  
  while (end >= start) {
    let mid = Math.floor((end - start) / 2) + start
    
    if (array[mid] === value) {
      return true
    } else if (array[mid] > value) {
      end = mid - 1
    } else {
      start = mid + 1
    }
  }
  
  return false
}