The k largest of n values: keep the best k so far in a min-heap and let each new value challenge its root. O(n log k) comparisons, against O(n log n) for sorting everything and O(n) on average for quickselect.
This interactive visualization needs JavaScript.