public class SearchUtils {
/**
* 二分查找
*/
public static void boundarySearch(int[] a, int n, int value) {
int low = 0;
int high = n - 1;
while (low <= high) {
int mid = low + (high - low)/2;
if (a[mid] == value) {
Log.d("zpb", "find index=" + mid);
return;
}
if (a[mid] > value) {
high = mid - 1;
} else {
low = mid + 1;
}
}
Log.d("zpb", "not find ");
}
}