diff options
| author | Raymond Hettinger <python@rcn.com> | 2004-06-13 05:26:33 (GMT) |
|---|---|---|
| committer | Raymond Hettinger <python@rcn.com> | 2004-06-13 05:26:33 (GMT) |
| commit | 2e3dfaf7070900c459d5879530dbdb3680f7fb9d (patch) | |
| tree | c6d22113751862d95c53cd2a19fb42aa8d9f5b2c /Doc | |
| parent | c929766361b4e0ea5bf5dc625e326fb954956f0b (diff) | |
| download | cpython-2e3dfaf7070900c459d5879530dbdb3680f7fb9d.zip cpython-2e3dfaf7070900c459d5879530dbdb3680f7fb9d.tar.gz cpython-2e3dfaf7070900c459d5879530dbdb3680f7fb9d.tar.bz2 | |
Install C version of heapq.nsmallest().
Diffstat (limited to 'Doc')
| -rw-r--r-- | Doc/lib/libheapq.tex | 5 |
1 files changed, 0 insertions, 5 deletions
diff --git a/Doc/lib/libheapq.tex b/Doc/lib/libheapq.tex index 4585058..5a140ab 100644 --- a/Doc/lib/libheapq.tex +++ b/Doc/lib/libheapq.tex @@ -97,11 +97,6 @@ by \var{iterable}. Equivalent to: \code{sorted(iterable)[:n]} \versionadded{2.4} \end{funcdesc} -Though the above functions appear symmetrical, they each have different -speed and space requirements. In particular, \function{nsmallest()} -operates on a full copy of the dataset. In contrast, \function{nlargest()} -only requires storage space for \var{n} elements. - Both functions perform best for smaller values of \var{n}. For larger values, it is more efficient to use the \function{sorted()} function. Also, when \code{n==1}, it is more efficient to use the builtin \function{min()} |