编辑代码

public class BinarySearch {
    public static boolean binarySearch(int[] arr, int key) {
        int low = 0;
        int high = arr.length - 1;

        while (low <= high) {
            int mid = (low + high) / 2;

            if (arr[mid] == key) {
                return true; // 返回true表示找到了目标元素
            }

            if (arr[mid] < key) {
                low = mid + 1;
            } else {
                high = mid - 1;
            }
        }

        return false; // 返回false表示未找到目标元素
    }

    public static void main(String[] args) {
        int[] arr = {85, 63, 52, 34, 25, 17, 6};
        int key = 6;

        boolean found = binarySearch(arr, key);

        if (found) {
            System.out.println("元素 " + key + " 存在于数组中");
        } else {
            System.out.println("元素 " + key + " 不存在于数组中");
        }
    }
}