public class BinaryFind {
public static void main(String[] args) {
int[] a = new int[1000000];
//省去排序的步奏
for(int i = 0; i < a.length; i++){
a[i] = i;
}
int result = 23456;
int position = search(a,result);
System.out.println("查找的数的位置是:" + position);
}
private static int search(int[] a,int result) {
if(a.length < 0){
return -1;
}else{
int start = 0;
int end = a.length - 1;
int mid = (start + end)/2;
while(start < end){
if(result == a[mid]){
return mid;
}else if(result < a[mid]){
end = mid - 1;
}else{
start = mid + 1;
}
mid = (start + end)/2;
}
}
return -1;
}
}
转载于:https://www.cnblogs.com/EmperLin/p/3504330.html
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系:hwhale#tublm.com(使用前将#替换为@)