int Binary_search(int array[], int l, int r, int x){
int mid = l + r >> 1;
while (l < r)
{
int mid = l + r >> 1;
if (array[mid] >= x) r = mid;
else l = mid + 1;
}
if (array[l] == x) return l;
return -1;
}
qwereqwr
最新推荐文章于 2024-10-05 18:02:32 发布