How to Find an Element in a Vector in C++

To find an element in a std::vector in C++, use the std::find function from the <algorithm> header. It returns an iterator to the element if found, or the vector's end() iterator if not found.

Syntax

The basic syntax to find an element in a vector is:

• std::find(container.begin(), container.end(), value)

Here, container.begin() and container.end() define the range to search, and value is the element you want to find.

The function returns an iterator pointing to the found element or container.end() if the element is not found.

cpp

auto it = std::find(vector.begin(), vector.end(), value);

Example

This example shows how to find the number 5 in a vector of integers and print if it was found or not.

cpp

#include <iostream>
#include <vector>
#include <algorithm> // for std::find

int main() {
    std::vector<int> numbers = {1, 3, 5, 7, 9};
    int target = 5;

    auto it = std::find(numbers.begin(), numbers.end(), target);

    if (it != numbers.end()) {
        std::cout << "Found element " << target << " at position " << (it - numbers.begin()) << "\n";
    } else {
        std::cout << "Element " << target << " not found in vector.\n";
    }

    return 0;
}

Output

Found element 5 at position 2

Common Pitfalls

Common mistakes when finding elements in a vector include:

• Not including the <algorithm> header, which causes std::find to be undefined.
• Forgetting to check if the returned iterator equals vector.end() before using it, which can lead to invalid access.
• Using std::find on unsorted vectors when you want faster search; in that case, consider sorting and using std::binary_search.

cpp

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

int main() {
    std::vector<int> v = {10, 20, 30};
    int val = 20;

    // Wrong: Not checking if found
    auto it = std::find(v.begin(), v.end(), val);
    std::cout << *it << "\n"; // Unsafe if val not found

    // Right: Check before dereferencing
    if (it != v.end()) {
        std::cout << "Found: " << *it << "\n";
    } else {
        std::cout << "Not found" << std::endl;
    }

    return 0;
}

Output

20
Found: 20

Quick Reference

Function	Description	Return Value
std::find(begin, end, value)	Searches for value in range [begin, end)	Iterator to element or end if not found
vector.begin()	Returns iterator to first element	Iterator
vector.end()	Returns iterator past last element	Iterator
std::binary_search(begin, end, value)	Checks if value exists in sorted range	bool

Key Takeaways

Use std::find with vector.begin() and vector.end() to locate an element.

Always check if the iterator returned by std::find equals vector.end() before using it.

Include header to use std::find.

For faster search on sorted vectors, consider std::binary_search.

Dereferencing an iterator without checking can cause runtime errors.