//二分搜索算法 11 20 29 39 40 47 50 chazhao21
public class demo1129_01 {
/**
* @param args
*/
public static int b(int[] a,int k,int low,int hight){
while (low<=hight) {
int z =(low+hight)/2;
if (a[z]>k) {
hight=z-1;
}else if (a[z]<k) {
low=z+1;
}else {
k=z;
return k;
}
}
return -1;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] a={11,20,29,39,40,47,50};
int x=b(a,20,0,a.length - 1);
int y=b(a,47,0,a.length - 1);
System.out.println(x);
System.out.println(y);
}
}