递归实现二分查找
public class 二分查找 {
public static void main(String[] args) {
int arr[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41 };
System.out.println(binarySerch(arr, 13));
}
public static int binarySerch(int arr[], int key) {
return binarySerchCore(arr, 0, arr.length - 1, key);
}
public static int binarySerchCore(int arr[], int left, int right, int key) {
int mid = left + (right - left);
if (arr[mid] == key) {
return mid;
}
if (left > right) {
return -1;
}
if (key < arr[mid]) {
return binarySerchCore(arr, left, mid - 1, key);
}
if (key > arr[mid]) {
return binarySerchCore(arr, mid + 1, right, key);
}
return -1;
}
}