John a écrit :
> 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://www.catb.org/~esr/faqs/smart-questions.html#homework
-- 
http://mail.python.org/mailman/listinfo/python-list

Reply via email to