How do I implement binary search in C++?

How do I implement binary search in C++?

To implement binary search in C++, you need a sorted array and a target value. Here's a simple example:

Can you show me the code for that?

Sure! Here's a basic implementation:

int binarySearch(int arr[], int size, int target) {
    int left = 0;
    int right = size - 1;
    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; // Target not found
}

What if the array is not sorted?

Binary search only works on sorted arrays. You would need to sort the array first, using algorithms like quicksort or mergesort.

Can you explain how the binary search algorithm works?

Certainly! Binary search works by repeatedly dividing the search interval in half. If the target value is less than the middle element, it narrows the interval to the lower half; otherwise, it narrows to the upper half. This process continues until the target is found or the interval is empty.