二分查找法的实现

`
>

package cn.wzq.find;

public class Find {

public int find(int[] array, int start, int end, int target) {

    if (end < start) {
        return Integer.MAX_VALUE;
    }

    int mid = (start + end) / 2;
    if (array[mid] == target) {
        return mid;
    } else if (array[mid] < target) {
        find(array, start, mid - 1, target);
    } else if (array[mid] > target) {
        find(array, mid + 1, end, target);
    }

    return Integer.MAX_VALUE;
}

public static void main(String[] str) {

    int[] array = {1, 2, 3, 4, 5, 6, 8, 9, 20, 21, 22, 23, 24, 25};
    Find find = new Find();
    int tartIndex = find.find(array, 0, array.length, 10);
    System.out.println(tartIndex);

}

}
`