public class Exerse1{
public static boolean binarySearch(int[] arr,int a){
int first=0;
int end=arr.length-1;
int mid1;
while(first<=end){
mid1=(first+end)/2;
if(a<arr[mid1]){
end=mid1-1;
}
else if(a>arr[mid1]){
first=mid1+1;
}
else{
return true;
}
}
return false;
}
public static void main(String[] args) {
int[] arr = new int[] {12, 23, 34, 45, 56, 67, 77, 89, 90};
Arrays.sort(arr);
boolean bool = binarySearch(arr,10);
System.out.print(bool);
}
}
需要注意的是二分查找要在有序的数组中进行,若数组是无序的要先进行排序,然后进行查找