On 2007-02-07, John <[EMAIL PROTECTED]> wrote: > 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.
I'll give you python code for that if you give me your degree
in the remotely possible case where you do graduate...
--
Grant Edwards grante Yow! Is this BOISE??
at
visi.com
--
http://mail.python.org/mailman/listinfo/python-list
