非递归方式实现
public static int binarySearch(int[] arr, int target) {
int left = 0;
int right = arr.length - 1;
int mid;
while (left <= right) {
mid = (left + right) / 2;
if (target == arr[mid]) {
return mid;
}
if (target < arr[mid]) {
right = mid - 1;
} else {
left = mid + 1;
}
}
return -1;
}
递归方式实现
public static int binarySearchRecur(int[] arr, int target, int left, int right) {
if(left>right){
return -1;
}
int mid = (left + right) / 2;
if (target == arr[mid]) {
return mid;
}
if (target < arr[mid]) {
return binarySearchRecur(arr, target, left, mid - 1);
} else {
return binarySearchRecur(arr, target, mid + 1, right);
}
}