I solved it myself. Don't bother. "John" <ruan at jcmills.com> wrote in message news:eqd8hr$44dn$1 at netnews.upenn.edu... > Given an array of elements, look at it as a binary tree. Start at the last > interior node, and downheap it. Then downheap the previous interior node, > and continue in this fashion, up to the root. >