二分查找:要求数组元素有序。
public static int serch(int[] arr, int num) {
int start = 0;
int end = arr.length;
int mid = (start + end) / 2;
while (start < mid) {
if (num < arr[mid]) {
end = mid;
} else if (num > arr[mid]) {
start = mid;
} else {
return mid;
}
mid = (start + end) / 2;
}
return -1;
}