What are the sorting algorithms available in C++11?

What sorting algorithms are available in C++11?

C++11 provides several sorting algorithms in the standard library, including std::sort, std::stable_sort, and std::partial_sort.

Can you explain the difference between std::sort and std::stable_sort?

Sure! std::sort is not stable, meaning it may change the order of equal elements, while std::stable_sort maintains the relative order of equal elements.

When should I use std::partial_sort?

Use std::partial_sort when you only need the top N elements sorted, as it can be more efficient than sorting the entire range.

Are there any performance considerations I should be aware of?

Yes, std::sort typically has a time complexity of O(n log n), while std::stable_sort has O(n log n) but with additional overhead due to maintaining stability.