【参考答案】
int b inary_search(int* arr, int key, int n){int low = 0;int h igh = n - 1 ;int m id;while (low <= high){mid = (high + low) / 2;if (arr[mid] > k)high = mid -1 ;else if (arr[mid] < k)low = mid + 1;elsereturn mid;}return -1;}
【参考答案】
int b inary_search(int* arr, int key, int n){int low = 0;int h igh = n - 1 ;int m id;while (low <= high){mid = (high + low) / 2;if (arr[mid] > k)high = mid -1 ;else if (arr[mid] < k)low = mid + 1;elsereturn mid;}return -1;}
名师互学网 版权所有 (c)2021-2022 ICP备案号：晋ICP备2021003244-6号
