二分法查找 数组 int arr[] = new int[]{2,4,5,8,12,15,19,26,37,49,51,66,89,100}；查找元素5是否在上述数组中出现过？输出对应的索引值

package EXER2;
public class BinarySearchTest {
    public static void main(String[] args) {
        int arr[] =new int[]{2,4,5,8,12,15,19,26,37,49,51,66,89,100};
        int target = 1;
        int head = 0;
        int end = arr.length - 1;
        boolean isFlag = false;
        while(head <= end){
            int middle = (head + end)/2;
            if(target == arr[middle]){
                System.out.println("找到了" + target + " 对应的位置 " + middle);
                isFlag = true;
                break;
            }else if (target > arr[middle]){
                head = middle + 1;
            }else if(target < arr[middle]){
                end = middle - 1;
            }
        }
        if (!isFlag){
            System.out.println("不好意思，没有找到" + target);

        }
    }

}