数组的二分法查找数据
使用前提:
public class ArrayForTowWayMethod {
public static void main(String[] args) {
int[] arr = {-95,-55,-2,10,34,52,64,75,80};
int head = 0;
int end = arr.length-1;
int dest = 10;
boolean isFlag = true;
while (head < end){
int middle = (head+end)/2;
if (arr[middle] == dest){
System.out.println("查找的数字的位置在第"+(middle+1)+"位");
isFlag = false;
break;
}else if (arr[middle] < dest){
head = middle - 1;
}else if (arr[middle] >dest){
end = middle + 1;
}
}
if (isFlag == true){
System.out.println("该查找数字不在被查找的数组中!");
}
}
}
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系:hwhale#tublm.com(使用前将#替换为@)