编辑代码

public class BinarySearchExample {

    public static boolean binarySearchDescending(int[] array, int k) {
        int low = 0;
        int high = array.length - 1;

        while (low <= high) {
            int mid = low + (high - low) / 2;
            if (array[mid] == k) {
                return true;
            } else if (array[mid] > k) {
                low = mid + 1;
            } else {
                high = mid - 1;
            }
        }
        return false;
    }

    public static void main(String[] args) {
        int[] data = {85, 63, 52, 34, 25, 17, 6};
        int k = 6;
        boolean found = binarySearchDescending(data, k);
        if (found) {
            System.out.println( k + "存在");
        } else {
            System.out.println( k + "不存在");
        }
    }
}