java折半查找（递归版）

import java.util.Scanner;

/**
 * @author Administrator 递归算法折半查找
 */
public class zhebanchazhao_1 {

    public static void main(String[] args) {

        int[] a = new int[100];
        int x;
        Scanner cin = new Scanner(System.in);

        x = cin.nextInt();
        for (int i = 0; i < x; i++) {
            a[i] = cin.nextInt();
        }
        int b = cin.nextInt();
        System.out.println(IterBiSearch(a, b, 0, x));

    }

    public static int IterBiSearch(int data[], int x, int beg, int last) {
        int mid = -1;
        mid = (beg + last) / 2;
        if (x == data[mid]) {
            return mid;
        } else if (x < data[mid]) {
            return IterBiSearch(data, x, beg, mid - 1);
        } else if (x > data[mid]) {
            return IterBiSearch(data, x, mid + 1, last);
        }
        return -1;
    }

}