package zuoye2;
/**
* 二分法查找——折半检索
*/
import java.util.Arrays;
public class study00 {
public static void main(String[] args) {
int[] a = {30,20,50,10,80,9,7,12,100,40,8};
Arrays.sort(a);
System.out.println(Arrays.toString(a));
System.out.println(find(a,50));
}
public static int find(int[] a,int num) {
//num查找的数字
int low=0;//左侧边界
int high=a.length-1;//右侧边界
while(low<=high) {
int mid=(low+high)/2;
if(num==a[mid]) {
return mid;
}
if(num>a[mid]) {
low=mid+1;
}
if(num<a[mid]) {
high=mid-1;
}
}
return -1;
}
}