编辑代码

public class BinarySearch {

    public static void main(String[] args) {
        int[] arr = {85, 63, 52, 34, 25, 17, 6};
        int key = 6;
        int result = binarySearch(arr, key);
        if (result == -1) {
            System.out.println("数组中没有这个元素");
        } else {
            System.out.println("这个元素的索引是 " + result);
        }
    }

    public static int 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 mid;
            } else if (arr[mid] > key) {
                low = mid + 1;
            } else {
                high = mid - 1;
            }
        }

        return -1;
    }
}