From 85f7f83d71e08ccd44ea1e6bf351a7fa0a9c1ba4 Mon Sep 17 00:00:00 2001 From: Tim Peters Date: Tue, 10 Dec 2002 21:04:25 +0000 Subject: [PATCH] Added a word to the heapq description in response to user confusion. --- Doc/whatsnew/whatsnew23.tex | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/Doc/whatsnew/whatsnew23.tex b/Doc/whatsnew/whatsnew23.tex index 2fb8abf6f8..ada6f07a34 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 -- 2.40.0