二分算法

BinarySearch:

int binarySearch(int a[],int len,int target){
	int l=0,r=len-1,mid;
	while(l<=r){
		mid=(r-l)/2+l;
		if(a[mid]==target) return mid;
		if(a[mid]<target) l=mid+1;
		else r=mid-1;
	}
	return -1;
} 

lowerBound

int lowerBound(int a[],int len,int target){
	//目标值的下边界
	int l=0,r=len-1,mid,lastPos=-1;
	while(l<=r){
		mid = (r-l)/2+l;
		if(a[mid]<target){
			l=mid+1;
			lastPos = mid;
		} else r=mid-1;
	} 
	return lastPos;
}

upperBound

int upperBound(int a[],int len,int target){
	//求目标值的上边界
	int l=0,r=len-1,mid,lastPos=len;
	while(l<r){
		mid = (r-l)/2+l;
		if(a[mid]>target){
			r=mid-1;
			lastPos = mid;
		}else l = mid+1;
	} 
	return lastPos;
}