function binarySearch(mapData,item){
let low = 0;
let high = mapData.length;
while (low<=high){
mid = parseInt((low+high)/2);
guess = mapData[mid]
if(guess===item){
return mid;
// 猜测的数字比规定的数字大,则需要往小猜
}else if(guess>item){
high = mid - 1;
}else{
low = mid + 1;
}
}
return null;
}
testMapData = [1,3,5,7,9];
binarySearch(testMapData,3);//1
binarySearch(testMapData,-1);//null