编辑代码

public class BinarySearch {
    public static void main(String[] args) {
        int[] array = {85, 63, 52, 34, 25, 17, 6};
        binarySearch(6, array, array.length);
    }

    private static void binarySearch(int searchKey, int array[], int length) {
        int low = 0;
        int high = length - 1;
        int keyPos = -1;
        while (low <= high) {
            int mid = low + ((high - low) / 2);
            if (searchKey == array[mid]) {
                System.out.println("元素："+searchKey+"存在");
                break;
            } else if (searchKey < array[mid]) {
                low = mid + 1;
            } else {
                high = mid - 1;
            }
        }
     }
}