二分法查找（折半查找）

function binarySearch(arr, target){

    let start = 0;
    let end = arr.length - 1;
    if(!end) return -1
    if(end == 1){
        return arr[0] === target ? 0 : -1 
    }
    let middle;
    while(start <= end){
       // middle = (start + end) / 2 | 0; 
         middle = Math.floor((start + end)/2); // 向下取整
        if(arr[middle] === target){
            return middle
        }else if(target > arr[middle]){
            start = middle + 1
        }else{
            end = middle - 1
        }
    }
    return -1
}