Java之二分查找非递归方式

 /**
     * @param arr    待查找的数组  arr是升序排序
     * @param target 需要查找的数
     * @return 返回对应下标，-1表示没有找打
     */
    public static int binarySearch(int[] arr, int target) {
        int left = 0;
        int right = arr.length - 1;
        while (left <= right) {//说明继续查找
            int mid = (left + right);
            if (arr[mid] == target) {
                return mid;
            } else if (arr[mid] > target) {
                right = mid - 1;//需要向左查找
            } else {
                left = mid + 1;//需要向右查找
            }
        }
        return -1;
    }

main方法测试:

public static void main(String[] args) {
        int[] arr = {1, 3, 8, 10, 11, 67, 100};
        int index = binarySearch(arr, 3);
        System.out.println("index=" + index);
    }