二分查找伪码描述

int binary_search(vectorv,int key)
{
int left=1,right=v.size()-1,mid;
while(left<=right)
{
mid=(left+right)/2;
if(v[mid]<key) left=mid+1;
else if(v[mid]>key) right=mid-1;
else if(v[mid]==key) return mid;
}
return -1;
}