Binary Search 3

let arr = [1, 5, 14, 23, 27, 32, 40, 54, 59, 67, 73]
let target = 54

let binarySearchFunction = function(arr, target) {
  let leftPointer = 0
  let rightPointer = arr.length - 1
  
  while (leftPointer <= rightPointer) {
  
    let med = Math.ceil((rightPointer + leftPointer) / 2)
    
    if (arr[med] === target) return med
    
    if (arr[med] > target) {
      rightPointer = med - 1
    }
    
    if (arr[med] < target) {
      leftPointer = med + 1
    }
    
  }
  
  return -1
}