STL - vector algorithm-优快云博客

本文演示了如何使用C++ STL中的向量容器进行元素查找、排序及反转等操作。首先创建了一个包含1到6随机顺序的向量，接着找出并打印最小和最大元素，展示了原始向量的状态。随后对向量进行了排序，并再次打印了排序后的向量。最后，文章介绍了如何找到值为3的元素位置，并反转该元素及其后所有元素的顺序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

// create vector with elements from 1 to 6 in arbitrary order
    vector<int> coll = { 2, 5, 4, 1, 6, 3 };

    // find and print minimum and maximum elements
    auto minpos = min_element(coll.cbegin(), coll.cend());
    cout << "min: " << *minpos << endl;
    auto maxpos = max_element(coll.cbegin(), coll.cend());
    cout << "max: " << *maxpos << endl;

    cout << "original vector:" << endl;
    ContainerUtil<vector<int>>::printElements(coll);
    // sort all elements
    sort(coll.begin(), coll.end());
    cout << "after sorting:" << endl;
    ContainerUtil<vector<int>>::printElements(coll);
    
    // find the first element with value 3
    // - no cbegin()/cend() because later we modify the elements pos3 refers to
    auto pos3 = find(coll.begin(), coll.end(), 3);                     

    // reverse the order of the found element with value 3 and all following elements
    reverse(pos3, coll.end());
    cout << "after reverse from the position of value 3:" << endl;
    ContainerUtil<vector<int>>::printElements(coll);