[javase]二分法查找

package day6;
//二分法查找数组的下标，极大提高效率，前提是数组已经排好序
public class ErFen {
public static void main(String[] args) {
int[]a= {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16};
int key=13;//要寻找的
int start=0;
int end=a.length-1;
for(int i=(start+end)/2;i<end;) {
if(a[i]>key) {
end=(start+end)/2;
i=(start+end)/2;
}
else if(a[i]<key) {
start=(start+end)/2;
i=(start+end)/2;
}
else if(a[i]==key){
System.out.println(i);
break;
}
if(end-start==1) {
System.out.println("无法找到该元素");
break;
}
}
}
}