折半查找法

int BinaryChop(int arr[], int nBegin.int nEnd, int target) {
	if (arr == NULL || nBegin > nEnd) return -1;

	int nMind = nBegin + (nEnd - nBegin) / 2;
	if (arr[nMid] == target) {
		return nMind;
	}
	else if (arr[nMind] > target) {
		return BinaryChop(arr, nBwgin, nMid - 1, target);
	}
	else {
		return BinaryChop(arr, nMid + 1, nEnd, target);
	}

}