查找算法

    // 二分查找 折半查找

    public int SearchErCha(int[] array, int start, int len, int s) {
        if (len == 0) {
            return -1;
        }
        int center = start + len / 2;
        if (array[center] == s) {
            return center;
        } else if (array[center] > s) {
            return SearchErCha(array, start, center - start + 1, s);
        } else {
            return SearchErCha(array, center, start + len - 1 - center + 1, s);
        }
    }

    public static int[] array = { 1, 2, 3, 4, 5, 6, 8, 9, 12, 67 };

    public static void main(String[] args) {
        Search search = new Search();
        int id = search.SearchErCha(array, 0, array.length, 5);

        System.out.println(id);

    }