I solved it myself. Don't bother. "John" <[EMAIL PROTECTED]> wrote in message news:[EMAIL PROTECTED] > 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. >
-- http://mail.python.org/mailman/listinfo/python-list
