用c++实现二分法查找算法
时间: 2023-12-23 16:28:39 浏览: 44
以下是用C++实现二分法查找算法的示例代码:
```cpp
#include <iostream>
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;
}
if (arr[mid] < target) {
left = mid + 1;
} else {
right = mid - 1;
}
}
return -1;
}
int main() {
int arr[] = {1, 3, 5, 7, 9};
int n = sizeof(arr) / sizeof(arr[0]);
int target = 5;
int result = binarySearch(arr, 0, n - 1, target);
if (result == -1) {
std::cout << "Element not found" << std::endl;
} else {
std::cout << "Element found at index " << result << std::endl;
}
return 0;
}
```