针对的是排好序的数组 ,思路每次这种查询,提高效率
int[] param = {0,1,2,3,4,5,10,12};
Arrays.sort(param);
int value = 10;
int low = 0;
int middle;
int cow = param.length;
while (true) {
middle = (low + cow) / 2;
if (param[middle] == value) {
return;
} else if (low > cow) {
return;
} else {
if (param[middle] > value) {
cow = middle - 1;
} else {
low = middle + 1;
}
}
}