Sort Containers with std::sort()
Explore how to use std::sort() for sorting containers with random-access iterators in C++ STL. Learn to check if containers are sorted, randomize data, and apply optional custom comparison functions. Understand the use of partial_sort() for partial sorting and partition() for element rearrangement to improve data manipulation and sorting efficiency.
We'll cover the following...
The problem of how to efficiently sort comparable elements is essentially solved. For most applications, there's no reason to re-invent this wheel. The STL provides an excellent sorting solution via the std::sort() algorithm. While the standard does not specify a sorting algorithm, it does specify a worst-case complexity ofn elements.
Just a few decades ago, the quicksort algorithm was considered a good compromise for most uses and was generally faster than other comparable algorithms. Today we have ...