Reactions to story from O'Reilly ONLamp Blog
PyMOTW: heapq
http://www.oreillynet.com/ onlamp/ blog/ 2008/ 05/ pymotw_heapq.html
The heapq implements a min-heap sort algorithm suitable for use with Python’s lists. Module: heapq Purpose: In-place heap sort algorithm Python Version: New in 2.3 with additions in 2.5 Description: A heap is a tree-like data structure where the child nodes have a sort-order relationship with the parents. Binary heaps can be represented using a list or array organized so that the children of element N are at positions 2*N+1 and 2*N+2 (for zero-based indexes). This feature makes it possible to rearrange heaps in place, so it is not necessary to reallocate as much memory when adding or removing items.
More rising blog posts
-
Entertainment »
Shuhei Yoshida announced as Harrison's successor -
Business »
Yes, the Advertisements are Hosed -
Lifestyle »
USGBC Set to Open 'LEED 2009' for Public Comment -
Politics »
How to make an iPod speaker from a greetings card in six easy steps -
Sports »
New International Track and Field footage -
Technology »
Study: Cox, Comcast Internet subscribers blocked
Recent posts from O'Reilly ONLamp Blog
-
MySQL vs. Microsoft SQL
21 hours ago -
Deployment is Colonization
22 hours ago -
First Release of Moonlight for Linux Supports Silverlight 1.0
1 day ago
