>Can you remind me what heapsort does?
It basically sorts an array by representing it as a binary tree,
where each parent should be greater than either child.
The performance of the worst case is considered O(NlgN). If you
have any data structures and algorithms book handy, there should
be a blurp about the heap sort.
Leo
------------------------------
