title: How do I find the median of numbers in linear time using heaps?
body: <p><a href="http://en.wikipedia.org/wiki/Heap_(data_structure)#Heap_applications" rel="noreferrer">Wikipedia</a> says:</p>
  <blockquote>
  <p>Selection algorithms: Finding the min,
  max, both the min and max, <strong>median</strong>, or
  even the k-th largest element can be
  done in linear time using heaps.</p>
  </blockquote>
  <p>All it says is that it can be done, and not how.</p>
  <p>Can you give me some start on how this can be done using heaps?</p>