二分查找只能处理有序的数组,在数组中找到一个等于待查找值就返回其下标。
一、代码
public class BinarySearch {
public static void main(String[] args) {
int[] arr = { 1, 8, 10, 89, 1000, 1234 };
int resIndex = binarySearch(arr, 0, arr.length - 1, 88);
System.out.println("resIndex = " + resIndex);
}
public static int binarySearch(int[] arr, int left, int right, int findVal) {
if(left > right) {
return -1;
}
int mid = (left + right) / 2;
int midVal = arr[mid];
if (findVal > midVal) {
return binarySearch(arr, mid + 1, right, findVal);
} else if (findVal < midVal) {
return binarySearch(arr, left, mid - 1, findVal);
} else {
return mid;
}
}
}
二、结果
resIndex = -1