二分查找的实现

template<class T>
int BiSearch(T Array[], int size, T value)
{
	int mid, front, end;
	front = 0;
	end = size-1;
	while (front < end) 
	{
		mid = (front + end)/2;
		if (Array[mid] == value)
			return mid;
		else if (Array[mid] > value)
			end = mid-1;
		else 
			front = mid +1;
	}

	return -1;
}

从大一写过之后，好像就再也没有写过了，常用算法还是得经常练一练。