二分法查找
java中二分法的API:
Arrays.binarySearch(int[] array, int 元素)
public static int Find(int[] arr, int value) {
int low = 0;
int high = arr.length - 1;
while(low <= high){
int middle = (low + high) / 2;
if(value == arr[middle]){
System.out.println(middle);
return middle;
}
if(value > arr[middle]){
low = middle + 1;
}
if(value < arr[middle]){
high = middle - 1;
}
}
return -1;
}