JavaScript二分法寻找数组元素

        var arr = [3,45,66,77,88,99,323,456,567,899]
        function searching(tar) {
            var start = 0,
                end = arr.length - 1,
                middle,
                element
            // while 循环会在指定条件为真时循环执行代码块。
            while (start <= end) {
                middle = Math.floor((start + end) / 2);
                console.log('中位数:',middle);
                element = arr[middle]
                console.log('中位数对应的值:',element);
                if(element === tar){
                    return middle;
                } else if(tar < element){
                    end = middle - 1
                } else {
                    start = middle + 1
                }
            } return -1;
        }
        console.log(searching(99));