What is the time complexity of binary search in C++?

What is the time complexity of binary search in C++?

The time complexity of binary search in C++ is O(log n), where n is the number of elements in the array.

Can you explain why it's O(log n)?

Sure! Binary search works by repeatedly dividing the search interval in half. This halving process leads to a logarithmic time complexity.

What is the space complexity of binary search?

The space complexity of binary search is O(1) for the iterative version and O(log n) for the recursive version due to the call stack.

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

Certainly! Here's a simple implementation of binary search in C++:

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
}