编辑代码

public class TestQiMo {
    public static void main(String[] args) {
        TestQiMo su = new TestQiMo();
        int[] arr = {85,63,52,34,25,17,6};
        int res = su.binarySearch(arr, 6);
        System.out.println("位置在：" + res);
    }

    
    public int binarySearch(int[] arr, int findElem) {
        int low = arr.length - 1;
        int high = 0;
        int mid;
        while (low >= high) {
            mid = (low + high) / 2;
            
            if (findElem < arr[mid]) {
                high = mid + 1;
            }
            
            if (findElem > arr[mid]) {
                low = mid - 1;
            }
            if (arr[mid] == findElem) {
                return mid;
            }
        }
        return -1;
    }

}