What is C++ vector searching?

Can you explain what vector searching is in C++?

Sure! Vector searching in C++ refers to the process of finding elements within a vector, which is a dynamic array.

What are some common methods for searching in a vector?

Common methods include linear search, binary search (if the vector is sorted), and using the STL algorithms like std::find.

How does binary search work in a vector?

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 to the upper half.

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

Certainly! Here's a simple example:

#include <iostream>
#include <vector>
#include <algorithm>

int binarySearch(const std::vector<int>& vec, int target) {
    int left = 0, right = vec.size() - 1;
    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (vec[mid] == target) return mid;
        if (vec[mid] < target) left = mid + 1;
        else right = mid - 1;
    }
    return -1; // Target not found
}

This function returns the index of the target if found, or -1 if not.