C++二分法

/**
*param arr  有序数组
*param n  数据长度
*param key 查找关键字
*/
int search(int arr[],int n ,int key){
int maxkey=n-1,minkey=0,midkey;
while(maxkey>=minkey){
midkey=(maxkey+minkey)/2;
cout<<"maxkey="<<maxkey<<";开始查找"<<midkey<<endl;

if(arr[midkey]==key){
cout<<"当前值在数组的序号为"<<midkey<<endl;
return midkey;
}else if(arr[midkey]>key){
maxkey=midkey-1;
}else{
minkey=midkey+1;
}
if(maxkey<minkey){
cout<<"在数组中不存在";
}
}
return -1;
}