算法学习-二分查找

int Find(const int *array, int size, int a)
{
	int nHigh = size - 1;
	int nLow = 0;
	int nMid;
	while (nLow <= nHigh)
	{
		nMid = (nHigh + nLow) / 2;
		if (array[nMid] > a)
		{
			nHigh = nMid - 1;
		}
		if (array[nMid] < a)
		{
			nLow = nMid + 1;
		}
		if (array[nMid] == a)
		{
			return nMid;
		}
	}
	return -1;
}