function binarySerach(arr,val,leftIndex,RightIndex){
// console.log(leftIndex,RightIndex)
// 这里一定要向上取整,不然查找最后一个元素的时候可能会陷入死循环
var mid = Math.ceil((leftIndex+RightIndex)/2);
// console.log(mid)
var midVal = arr[mid];
if(midVal>val){
binarySerach(arr,val,leftIndex,mid);
console.log("在左边");
}else if(midVal<val){
binarySerach(arr,val,mid,RightIndex);
console.log("在右边");
}else{
console.log("找到了,下标为"+mid);
}
}