import java.util.Arrays;
public class BinarySearch {
//查找出来的位置是数组的位置,从0开始
public static int rank(int key, int[] a){
//数组必须是有序
int lo = 0;
int hi = a.length - 1;
while(lo <= hi){
int mid = lo + (hi -lo) /2;
if(key < a[mid]) hi = mid - 1;
else if(key > a[mid]) lo = mid + 1;
else return mid;
}
return -1;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] a = new int[]{1,4,2,3,5,6,0,9,7,8};
Arrays.sort(a);
System.out.println(rank(5,a));
}
}