How do I find the median of numbers in linear time using heaps?
- by eSKay
Wikipedia says:
Selection algorithms: Finding the min,
max, both the min and max, median, or
even the k-th largest element can be
done in linear time using heaps.
All it says is that it can be done, not how.
Can you give me some start on how this can be done using heaps?