Standard C++ Library Class Reference

stable_permutation
Algorithms that read from bidirectional iterators and write to output iterators:
reverse_copy
Algorithms that require random access iterators:
make_heap pop_heap sort
nth_element push_heap sort_heap
partial_sort random_shuffle stable_sort
Algorithms that read from input iterators and write to random access iterators:
partial_sort_copy
Complexity
The complexity for each of these algorithms is given in the manual page for that algorithm.
See Also
Manual pages for each of the algorithms named in the lists above.