Sorting Algorithms

partial_sort(), partial_sort_copy(), partition(), and stable_partition() have the complexity of O(nlogk), where k is the number of items to sort.

These will be the first k smallest items in the set (of size n).