What are the advanced sorting techniques in C++11?

What are the advanced sorting techniques in C++11?

C++11 introduced several features that enhance sorting, such as lambda expressions and the new std::sort algorithm.

Can you explain how to use lambda expressions with std::sort?

Sure! You can pass a lambda function as a custom comparator to std::sort. For example: std::sort(vec.begin(), vec.end(), [](int a, int b) { return a > b; }); sorts in descending order.

What are some other sorting algorithms available in C++11?

In addition to std::sort, C++11 provides std::stable_sort, which maintains the relative order of equivalent elements, and std::partial_sort, which sorts only a portion of the range.

How does std::stable_sort differ from std::sort?

std::stable_sort guarantees that equal elements retain their original order, while std::sort does not provide this guarantee.