二分查找【Java】

public class middle {
    public static void main(String[] args) {
        int[] arr = {11,22,33,44,55,66,77,88,99};
        System.out.println(myBinarySearch(arr,66));
    }

    public static int myBinarySearch(int[] arr,int key) {
        int left = 0;
        int right = arr.length-1;
        while(left <= right){
            int mid = (left + right) / 2;
            if (arr[mid] > key){
                right = mid - 1;
            } else if (arr[mid] < key) {
                left = mid + 1;
            }else {
                return mid;
            }
        }
        return -1;
    }
}

运行结果