sort() Sorts all elements 596 stable_sort() Sorts while preserving order of equal elements 596 partial_sort() Sorts until the first n elements are correct 599 partial_sort_copy() Copies elements in sorted order 600 nth_element() Sorts according to the nth position 602 partition() Changes the order of the elements so that elements that match a criterion are at the beginning 592 stable_partition() Same as partition() but preserves the relative order of matching and nonmatching elements 592 partition_copy() Copies the elements while changing the order so that elements that match a criterion are at the beginning 594 make_heap() Converts a range into a heap 604 push_heap() Adds an element to a heap 605 pop_heap() Removes an element from a heap 605 sort_heap() Sorts the heap (it is no longer a heap after the call) 605