二分搜索算法

    private static int binarySearch(int[] arr, int target) {
        int left = 0;
        int right = arr.length - 1;
        while (left <= right) {
            int  mid = left + (right - left) / 2;
            if(target == arr[mid]) {
                return  mid;
            } else if(target > arr[mid]) {
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }
      throw new RuntimeException();
    }