算法通关村——二分查找

public class BinarySearch {

    public static void main(String[] args) {
        int[] array = {1, 2, 5, 6, 8, 10, 15, 16, 18, 20, 15, 28, 30, 60, 80};

        int index = binarySearch(array, 10);//5

        System.out.println(index);
    }

    //循环实现
    static int binarySearch(int[] array, int target) {

        int left = 0;
        int right = array.length - 1;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (array[mid] == target) {
                return mid;
            } else if (array[mid] < target) { //小于目标元素，说明target在右边
                left = mid + 1;  //重新赋值left
            } else {
                right = mid - 1;
            }
        }
        return -1;
    }

}