编辑代码

public class Binary_search {

    // 二分查找算法
    static boolean binary_search(int[] arr, int e) {
        int low =arr.length - 1;
        int high = 0;

        while (low >= high) {
            int mid = low + (high - low) / 2;
            if (arr[mid] == e) return true;  // 找到e      
            else if (arr[mid] > e) high = mid + 1;
            else low = mid - 1;
        }
        return false; // 未找到e
    }

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

        if (binary_search(sorted_array, element_find)) 
            System.out.println("数组中存在元素：" + element_find);
        else 
            System.out.println("数组中不存在元素：" + element_find);
    }
}