JavaScript的二分查找代码

 function binarySearch(arr, item) {
     let low = 0
     let high = arr.length - 1
     while (low <= high) {
         const mid = Math.floor((high + low) / 2);
         const element = arr[mid]
         if (element < item) {
             low = mid + 1
         } else if (element > item) {
             high = mid - 1
         } else {
             return mid
         }
     }
     return -1
 }


 var arr = [1, 2, 3, 4, 5, 6, 7]

 console.log(binarySearch(arr, 3));