int bsearch(int x, int y, int v)
{
int m;
while(x < y)
{
m = (x + y) >> 1;
if(a[m] == v)
return m;
else if(a[m] > v)
y = m;
else
x = m + 1;
}
return -1;
}
二分查找
最新推荐文章于 2023-05-28 13:59:52 发布
int bsearch(int x, int y, int v)
{
int m;
while(x < y)
{
m = (x + y) >> 1;
if(a[m] == v)
return m;
else if(a[m] > v)
y = m;
else
x = m + 1;
}
return -1;
}