I'm looking for an algorithm to sort a large number of items using the fewest comparisons. My specific case makes it unclear which of the obvious approaches is appropriate: the comparison function is ...

Learning about C++, I'm reading the standard algorithms and the reference page says the following on partial_sort: partial_sort: sorts the first N elements of a range But when I click on the name of ...