法_找_查_分_二

/** http://mylir.iteye.com/blog/1117469
     * 二分查找法
     * @param index
     * @param data
     */
    public static void erFen(int[] index, int data)
    {
        Arrays.sort(index);
        int begin = 0;
        int end = index.length - 1;
        int midIndex = -1;
        if (data < index[begin] || data > index[end] || begin > end)
        {
            return;
        }
        while (begin <= end)
        {
            midIndex = (begin + end) / 2;
            if (data < index[midIndex])
            {
                end = midIndex - 1;
            }
            else if (data > index[midIndex])
            {
                begin = midIndex + 1;
            }
            else
            {
                System.out.println("找到了"); //$NON-NLS-1$
                break;
            }
        }
    }