public class Find01 {
// 二分查找
public static int binarySearch(int[] arr, int num) {
int star = 0;
int end = arr.length - 1;
while (star <= end) {
int middle = (star + end) / 2;
if (arr[middle] > num) {
end = middle - 1;
} else if (arr[middle] < num) {
star = middle + 1;
} else {
return middle;
}
}
return -1;
}
public static void main(String[] args) {
int[] arr = { 1, 8, 23, 3, 56, 4 };
Arrays.sort(arr);
System.out.println(Arrays.toString(arr));
int indxe = binarySearch(arr, 35);
System.out.println(indxe);
}
}