java二分法数组查找

package pack;

public class ErFenFa {
public static void main(String[] args) {
//二分法查找，前提所要查找的数组必须有序
int[] arr= {-32,-24,-22,-17,0,2,13,17,23,56};
int head=0;//初始的首索引
int end=arr.length-1;
int dest=-32;//初始的末索引
boolean flag=true;
while (head<=end) {
int middle=(head+end)/2;
if (dest==arr[middle]) {
System.out.println(“找到了指定的元素，位置在”+middle);
flag=false;
break;
}else if(dest>arr[middle]) {
head=middle+1;
}else {
end=middle-1;
}

	}
	if(flag) {
		System.out.println("很遗憾，没有找到呀！");
	}
}

}