java实现二分查询:
public class binSearch {
public static void main(String[] args) {
int[] array = {1,2,3,4,5};
System.out.println(binSearch(array,3));
}
public static int binSearch(int[] array,int num){
int start = 0;
int end = array.length-1;
while(start <= end){
int mid = (start+end)/2;
if (num > array[mid])
start = mid+1;
else if (num < array[mid])
end = mid-1;
else
return mid;
}
return -1;
}
}
运行结果: