编辑代码

public class BinarySearch {
    public static boolean search(int[] arr, int k) {
        int left = 0;
        int right = arr.length - 1;

        while (left <= right) {
            int mid = left + (right - left) / 2;

            if (arr[mid] == k) {
                return true; // 找到目标元素
            } else if (arr[mid] < k) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }

        return false; // 目标元素不存在
    }

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

        if (search(arr, k)) {
            System.out.println("元素 " + k + " 不存在于数组中。");
        } else {
            System.out.println("元素 " + k + " 存在于数组中。");
        }
    }
}