package com.ltl.test;
public class ErFenFa {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] arr=new int[] {-34,-2,3,6,24,69,84,120,256};
int dest=84;
int head=0;
int end=arr.length-1;
boolean isFlag=true;
while(head <= end) {
int middle = (head + end)/2;
if(dest == arr[middle]) {
System.out.println("找到了!"+middle);
isFlag=false;
break;
}else if(arr[middle]>dest) {
end=middle-1;
}else {
head=middle+1;
}
}
if(isFlag) {
System.out.println("未找到!");
}
}
}
java实现二分法
最新推荐文章于 2024-07-25 13:40:37 发布