What is binary search in C++?

Can you explain what binary search is in C++?

Sure! Binary search is an efficient algorithm for finding an item from a sorted list of items. It works by repeatedly dividing the search interval in half.

How does the algorithm work step by step?

First, you start with two pointers, one at the beginning and one at the end of the array. Then, you calculate the middle index and compare the middle element with the target value.

What happens if the middle element is less than the target?

If the middle element is less than the target, you move the left pointer to the middle index plus one, effectively narrowing the search to the right half of the array.

Can you show me a simple code example?

Certainly! Here's a simple C++ implementation:

int binarySearch(int arr[], int size, int target) {
    int left = 0, 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
}