When should I use binary search in C++?

Can you explain when to use binary search in C++?

Binary search is used when you have a sorted array and want to find an element efficiently.

What are the time complexities of binary search?

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

Are there any specific scenarios where binary search is preferred?

Yes, binary search is preferred in scenarios where the dataset is large and sorted, such as searching in databases.

Can you give me a code example of binary search in C++?

Sure! Here's a simple 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
}