package string;
public class BinarySearch {
public static void main(String[] args) {
int[] arr = { 3, 16, 24, 39, 44, 52, 66, 79, 88 };
int i = getIndex(arr,33);
System.out.println(i);
}
public static int getIndex(int[] arr, int num) {
int min = 0;
int max = arr.length - 1;
int mid = (min + max) / 2;
while (arr[mid] != num) {
if (arr[mid] > num) {
max = mid - 1;
} else if (arr[mid] < num) {
min = mid + 1;
}
mid = (min + max) / 2;
if (min >= max) {
return -1;
}
}
return mid;
}
}
java二分查找
于 2023-06-05 23:58:28 首次发布