二分查找

二分查找

int binaryserach(int *arr,int len,inr key)

{
	if(len<2 || arr[0] != key){
		return -1;
	}

	int left = 0;

	int right = len-1;

	int m=0；

	while(left <right){

		m = (right - left)/2 + left;

		//(left+right)/2 //防止整数溢出

		if(arr[m] == key){
			return m;
			}
		else if(arr[m] > key){
			right = m-1;
			}
		else if(arr[m] < key){
		left = m+1;}

	}

	return -1;

}