数据结构---函数题 （1）BinarySearch

Position BinarySearch(List L,ElemenType x)
{
	Position left=1;
	Position right=L.Last;

	while(left<=right)
	{
		Position center=(left+right)/2;
		if(x>L.Data[center])
		{
			left=center+1;
		}
		else if
		{
			right=center-1;
		}
		else return center;
	}
	return NotFound;
}