二分查找
2013-09-06 18:03
239 查看
public static int search(int[] array,int key){
int low=0;
int high=array.length-1;
int middle=(low+high)/2;
while(true){
if(key==array[middle]){
return middle;
}else if (low>high){
break;
}
if(key>array[middle]){
low= middle + 1;
middle=(low+high)/2;
}else if(key<array[middle]){
high= middle - 1;
middle=(low+high)/2;
}
}
return 0;
}
int low=0;
int high=array.length-1;
int middle=(low+high)/2;
while(true){
if(key==array[middle]){
return middle;
}else if (low>high){
break;
}
if(key>array[middle]){
low= middle + 1;
middle=(low+high)/2;
}else if(key<array[middle]){
high= middle - 1;
middle=(low+high)/2;
}
}
return 0;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐