I wrote a Heap class for ruby some time ago, and I just remembered it
exisits. It implements all the usual operations (insert, extract_max,
increase_key, etc.), and includes heapsort, an O(n log n) in-place
sorting algorithm. If anyone is interested, I will put it up on a web
page somewhere.

Jon
-- 
_______________________________________________________________________
  Jonathan Aseltine     aseltine / cs.umass.edu     MAS, Umass, Amherst