用c++实现二分查找
时间: 2024-01-11 14:21:54 浏览: 21
以下是用C++实现二分查找的示例代码:
```cpp
#include <iostream>
using namespace std;
int binarySearch(int arr[], int left, int right, int target) {
while (left <= right) {
int mid = left + (right - left) / 2;
if (arr[mid] == target) {
return mid;
}
else if (arr[mid] < target) {
left = mid + 1;
}
else {
right = mid - 1;
}
}
return -1; // 如果找不到目标元素,返回-1
}
int main() {
int arr[] = {1, 3, 5, 7, 9, 11, 13};
int target = 7;
int n = sizeof(arr) / sizeof(arr[0]);
int result = binarySearch(arr, 0, n - 1, target);
if (result == -1) {
cout << "目标元素不存在" << endl;
}
else {
cout << "目标元素在索引 " << result << " 处" << endl;
}
return 0;
}
```