public static int bisearch(int data[], int x) {
		int low = 0;// 开始位置
		int high = data.length - 1;// 中间位置
		int mid;// 中间位置
		if (low > high) {
			LOG.debug("the array is null");
			return NOT_FOUND;
		}
		while (low <= high) {
			mid = (low + high) / 2;
			if (x == data[mid]) {
				return mid;
			} else if (data[mid] < x) {
				low = mid + 1;
			} else if (data[mid] > x) {
				high = mid - 1;
			}
		}// end while
		LOG.debug("not found");
		return NOT_FOUND;
	}