The median of a stream after every value: a max-heap holds the low half, a min-heap the high half, and the median sits on their tops. O(log n) per value, against O(n) for keeping one sorted list.
This interactive visualization needs JavaScript.