学步园

int BinarySearch(int A[] , int N, int T)
{
	int low = 0 ;
	int high = N - 1 ;
	int mid ;
	while( low <= high)
	{
		mid = (low+high) /2 ;
		if (A[mid] > T) high = mid - 1 ;
		else if (A[mid] <T ) low = mid + 1 ;
		else  return Mid ; 
	}
	return -1 ;// Not found
}