Binary Search in C++

Binary Search in C++

 

#include <iostream>
#include <algorithm>

using namespace std;

int binary_search(int arr[], int size, int target) {
int low = 0;
int high = size – 1;

while (low <= high) {
int mid = (low + high) / 2;

if (arr[mid] == target) {
return mid;
} else if (arr[mid] < target) {
low = mid + 1;
} else {
high = mid – 1;
}
}

return -1;
}

int main() {
int arr[] = {1, 3, 5, 7, 9};
int size = sizeof(arr) / sizeof(arr[0]);
int target = 5;

int result = binary_search(arr, size, target);

if (result == -1) {
cout << “Target not found” << endl;
} else {
cout << “Target found at index ” << result << endl;
}

return 0;
}

 

• binary search
• c++
• running time
• algorithm
• programming
• performance
• time complexity