编辑代码

public class BinarySearch {
    public static boolean binarySearch(int[] arr, int k) {
        int left = 0;
        int right = arr.length - 1;
        while (left <= right) {
            int mid = (left + right) / 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 = {6, 17, 25, 34, 52, 63, 85};
        int k = 6;
        if (binarySearch(arr, k)) {
            System.out.println("元素 " + k + " 存在于数组中。");
        } else {
            System.out.println("元素 " + k + " 不存在于数组中。");
        }
    }
}