/**
* 二分查找算法递归实现
*
* @return
*/
public static int binarySearchRecuition(int a[], int low, int high, int key) {
if (high < low) {
return -1;
}
int mid = (low + high) / 2;
if (a[mid] == key) {
return low;
}
if (key <= a[mid]) {
return binarySearchRecuition(a, low, mid, key);
} else {
return binarySearchRecuition(a, mid + 1, high, key);
}
}