public class ErFenChaoZhao {
public static int binarySearch(int[] list, int key) {
int low = 0;
int high = list.length -1;
while (high >= low) {
int mid = (low +high) /2;
if(key <list[mid]) {
high = mid -1;
}
else if(key == list[mid]) {
return mid;
}else {
low = mid +1;
}
}
return -low -1;
}
public static void main(String[] args) {
System.out.println("jveejjvd: ");
int[] list = {1, 9, 4, 2, 5, -3, 6, 5};
int i = ErFenChaoZhao.binarySearch(list, 4);
System.out.println(i);
}
}
结果
jveejjvd:
-7