基础算法-二分查找

int bsearch(int num[], int start, int end, int target)
{
int left=start;
int right=end;
int mid;
while(left < right)
{
mid=(left+end)>>1;
if(num[mid]>target)    right=mid;
else    left=mid;
}
return mid;
}