//二分法查找
public static int binarySearch(int[] arr, int find) {
if (null == arr || arr.length == 0) {
System.out.println("Input parameter is invalid!");
return -1;
}
int minIndex = 0;
int maxIndex = arr.length - 1;
int middleindex = (minIndex + maxIndex) / 2;
while (minIndex < maxIndex) {
if (find < arr[middleindex]) {
maxIndex = middleindex - 1;
} else if (find > arr[middleindex]) {
minIndex = middleindex + 1;
}else {
return middleindex;
}
middleindex = (minIndex + maxIndex) / 2;
}
return -1;
}