How do I use the C++ Standard Library algorithms?

Can you explain how to use the sort function from the C++ Standard Library?

Sure! The std::sort function is used to sort elements in a range. You can use it like this: std::sort(begin, end); where begin and end are iterators pointing to the start and end of the range.

What if I want to sort in descending order?

You can provide a custom comparator. For descending order, you can use: std::sort(begin, end, std::greater<>()); This will sort the elements in descending order.

Can I sort a vector of custom objects?

Yes, you can! Just define a comparison function or a lambda that compares the objects based on the desired criteria, and pass it to std::sort.

Can you give me an example of sorting a vector of structs?

Absolutely! Here's a simple example:

struct Person {
    std::string name;
    int age;
};

std::vector<Person> people = {{"Alice", 30}, {"Bob", 25}};
std::sort(people.begin(), people.end(), [](const Person &a, const Person &b) {
    return a.age < b.age;
});

This will sort the people vector by age.