search提取当前迭代器，并使用std::advance向前移动迭代器

template< class ForwardIt1, class ForwardIt2 >
ForwardIt1 search( ForwardIt1 first, ForwardIt1 last, ForwardIt2 s_first, ForwardIt2 s_last );

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

int main() {
    std::vector<int> numbers = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};

    std::vector<int> searchValues = {3, 4, 5};

    auto result = std::search(numbers.begin(), numbers.end(), searchValues.begin(), searchValues.end());

    if (result != numbers.end()) {
        std::cout << "Found at position: " << std::distance(numbers.begin(), result) << std::endl;
    } else {
        std::cout << "Not found" << std::endl;
    }

    return 0;
}

Found at position: 2

template< class InputIt, class Distance >
void advance( InputIt& it, Distance n );

#include <iostream>
#include <iterator>
#include <vector>

int main() {
    std::vector<int> numbers = {1, 2, 3, 4, 5};

    auto it = numbers.begin();
    std::advance(it, 2);

    std::cout << "Value at position 2: " << *it << std::endl;

    return 0;
}

Value at position 2: 3