2021-03-10

``给定一个有序整型数组, 实现二分查找

class Test{
    public static void main(String[] args) {
        int[] arr={1,8,9,6};
        System.out.println(binarySearch(arr,9));
    }
    public static int  binarySearch(int[] arr,int toFind){
        int left=0;
        int right=arr.length-1;
        while(left<=right) {
            int mid = (left + right) / 2;
            if (toFind < arr[mid]) {
                right = mid - 1;
            } else if (toFind > arr[mid]) {
                left = mid + 1;
            } else {
                return mid;
            }
        }
        return -1;
        }
    }

截图