Mirror
/
cpython
mirror of https://github.com/python/cpython
4
1
Fork 0
Code Issues Releases Wiki Activity

merge

This commit is contained in:
Raymond Hettinger 2014-12-11 23:56:53 -08:00
parent d4a001b23c d2a296a73a
commit 31094a191e
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Doc/library/heapq.rst
View File

@ -272,11 +272,11 @@ However, there are other representations which are more efficient overall, yet
the worst cases might be terrible. the worst cases might be terrible.
Heaps are also very useful in big disk sorts. You most probably all know that a Heaps are also very useful in big disk sorts. You most probably all know that a
big sort implies producing "runs" (which are pre-sorted sequences, which size is big sort implies producing "runs" (which are pre-sorted sequences, whose size is
usually related to the amount of CPU memory), followed by a merging passes for usually related to the amount of CPU memory), followed by a merging passes for
these runs, which merging is often very cleverly organised [#]_. It is very these runs, which merging is often very cleverly organised [#]_. It is very
important that the initial sort produces the longest runs possible. Tournaments important that the initial sort produces the longest runs possible. Tournaments
are a good way to that. If, using all the memory available to hold a are a good way to achieve that. If, using all the memory available to hold a
tournament, you replace and percolate items that happen to fit the current run, tournament, you replace and percolate items that happen to fit the current run,
you'll produce runs which are twice the size of the memory for random input, and you'll produce runs which are twice the size of the memory for random input, and
much better for input fuzzily ordered. much better for input fuzzily ordered.