二分查找模板

int bsearch(int a[],int len,int v){int left,right,mid;left=0;right=len-1;while(left<=right){int mid=(left+right)>>1;if(a[mid]>v) right=mid-1;else if(a[mid]<v) left=mid+1;else return mid;}return -1;}

int bsearch(int a[],int len,int v){int left,right,mid;left=0;right=len;while(left<right){mid=(left+right)>>1;if(a[mid]>v) left=mid+1;else if(a[mid]<v) right=mid;else return mid;}return -1;}