diff options
| author | Tim Peters <tim.peters@gmail.com> | 2002-12-10 21:04:25 (GMT) |
|---|---|---|
| committer | Tim Peters <tim.peters@gmail.com> | 2002-12-10 21:04:25 (GMT) |
| commit | 85f7f83d71e08ccd44ea1e6bf351a7fa0a9c1ba4 (patch) | |
| tree | 5527b610222107943e6c86599f3c8ce8861e395a | |
| parent | 598c210b5a3870c775fce57e4b93a12c1c4883ea (diff) | |
| download | cpython-85f7f83d71e08ccd44ea1e6bf351a7fa0a9c1ba4.zip cpython-85f7f83d71e08ccd44ea1e6bf351a7fa0a9c1ba4.tar.gz cpython-85f7f83d71e08ccd44ea1e6bf351a7fa0a9c1ba4.tar.bz2 | |
Added a word to the heapq description in response to user confusion.
| -rw-r--r-- | Doc/whatsnew/whatsnew23.tex | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/Doc/whatsnew/whatsnew23.tex b/Doc/whatsnew/whatsnew23.tex index 2fb8abf..ada6f07 100644 --- a/Doc/whatsnew/whatsnew23.tex +++ b/Doc/whatsnew/whatsnew23.tex @@ -1104,8 +1104,9 @@ now return enhanced tuples: \item The new \module{heapq} module contains an implementation of a heap queue algorithm. A heap is an array-like data structure that -keeps items in a sorted order such that, for every index k, heap[k] <= -heap[2*k+1] and heap[k] <= heap[2*k+2]. This makes it quick to remove +keeps items in a partially sorted order such that, +for every index k, heap[k] <= heap[2*k+1] and heap[k] <= heap[2*k+2]. +This makes it quick to remove the smallest item, and inserting a new item while maintaining the heap property is O(lg~n). (See \url{http://www.nist.gov/dads/HTML/priorityque.html} for more |