Josh Rosenberg added the comment:

It's not really relevant what a heapified list looks like (and there is no 
reason to guarantee a particular appearance, since it's an implementation 
detail that could change). It's supposed to function as a heap with the heap 
functions, that's all. The docs do give a guarantee that a sorted list is 
already "heapified", but that's a one way guarantee: All sorted lists are 
heaps, but not all heaps are sorted lists.

The docs also mention the big-O behavior of heapify; it's linear time, O(n), 
while good general purpose sorting algorithms are O(n log n). A linear 
algorithm cannot sort a general list.

----------
nosy: +josh.rosenberg

_______________________________________
Python tracker <rep...@bugs.python.org>
<http://bugs.python.org/issue21185>
_______________________________________
_______________________________________________
Python-bugs-list mailing list
Unsubscribe: 
https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com

Reply via email to