How does binary search work in C++?

Can you explain how binary search works 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.

What is the time complexity of binary search?

The time complexity of binary search is O(log n), which makes it much faster than linear search for large datasets.

Can you provide a simple C++ code example for binary search?

Absolutely! Here's a simple example:

#include <iostream>
using namespace std;

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
}

What should I keep in mind while implementing binary search?

Make sure the array is sorted before applying binary search, and be careful with the indices to avoid overflow.