How is the sort function used in C++?

The sort function is an algorithm function in the C++ standard library used to sort elements in a container. Its usage is as follows:

1. Include the header file: #include
2. Sort the elements using the sort function: sort(begin, end, comp_function). Where:
3. The “begin” is the starting iterator of the container, pointing to the first element in the range to be sorted.
4. The ‘end’ is the terminating iterator of the container, pointing to the position after the last element of the range to be sorted.
5. The comp_function is an optional comparison function that specifies how elements are compared to each other. If this parameter is omitted, the “<" operator is used by default for comparison.
6. Example code:

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

bool comp(int a, int b) {
    return a < b;
}

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

    std::sort(nums.begin(), nums.end()); // 默认使用"<"运算符进行比较

    // 或者使用自定义的比较函数
    // std::sort(nums.begin(), nums.end(), comp);

    for (int num : nums) {
        std::cout << num << " ";
    }

    return 0;
}

The output is: 1 2 3 4, indicating that the elements in the container have been sorted in ascending order.

It’s important to note that the sort function will change the order of elements in the container, so it is recommended to back up the data before using it or ensure that the sorting operation will not affect other parts of the code logic.