C++实现二分查找在有序数组中寻找指定数字

```cpp #include <iostream> using namespace std; int binarySearch(int arr[], int n, int k) { int left = 0, right = n - 1; while (left <= right) { int mid = left + (right - left) / 2; if (arr[mid] == k) { return mid + 1; } else if (arr[mid] < k) { left = mid + 1; } else { right = mid - 1; } } return n + 1; } int main() { int n; cin >> n; int arr[100000]; for (int i = 0; i < n; i++) { cin >> arr[i]; } int k; cin >> k; cout << binarySearch(arr, n, k) << endl; return 0; } ``` ######[AI问答 | 248点数解答 | 2026-04-11 20:02:06]