int binsearch(int v[], int x, int n)
{
int low = 0;
int mid;
int high = n - 1;
while (low <= high)
{
mid = (low + high) / 2;
if (x < v[mid])
high = mid - 1;
else if (x > v[mid])
low = mid + 1;
else
return mid;
}
return -1;
}
binsearch
最新推荐文章于 2022-01-20 16:00:54 发布