二分 二分查找 二分查找 int binarysearch(int a[],int left,int right,int x) { int mid; while(left<=right) { mid=(left+right)/2; if(mid==x) { return mid; } else { if(a[mid]>x) { right=mid-1; } else { left=mid+1; } } } return -1; //查找失败就返回-1 }