二分查找只适用于 排好序的数组 Arrays.sort(arr);
public void twofind(){
int[] arr = {1, 2, 3, 4, 5, 6, 7};
int min = 0;
int max = arr.length-1;
int middle = (max + min) / 2;
int find = 3;
while (arr[middle] != find){
if(arr[middle] >find){
max = middle - 1;
}else if (arr[middle]<find){
min = middle+1;
}
middle = (max+min)/2;
}
System.out.println("middle的值为:"+middle);
}```