C++ STL sort用法

一：功能

     对区间内元素进行排序，不保证相等元素的顺序（不稳定排序）

二：用法

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

int main() {
    std::vector<int> data1 = {9, 1, 8, 2, 7, 3, 6, 4, 5};
    std::sort(data1.begin(), data1.end());
    for (auto v : data1) {
        std::cout << v << " ";
    }
    std::cout << "\n";

    std::list<int> data2 = {9, 1, 8, 2, 7, 3, 6, 4, 5};
    // std::sort(data.begin(), data.end()); // doesn't compile
    data2.sort();
    for (auto v : data2) {
        std::cout << v << " ";
    }
    std::cout << "\n";
}