int binary_search(int arr[], int k)
{
int left = 0;
int right = sizeof(arr)/sizeof(arr[0])-1;
while (left<=right)
{
int mid = left + (right - left) / 2;
if (arr[mid] > k)
{
right = mid - 1;
}
else if (arr[mid] < k)
{
left =</
二分查找(binary_search)----找数字之调用函数版
最新推荐文章于 2024-08-12 19:18:27 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)