diff options
| author | Tim Peters <tim.peters@gmail.com> | 2002-08-11 18:28:09 (GMT) |
|---|---|---|
| committer | Tim Peters <tim.peters@gmail.com> | 2002-08-11 18:28:09 (GMT) |
| commit | 5f7617b5f634dd52e6b3995198f18dd870ef22f2 (patch) | |
| tree | 8d71caacd0b3a1315fd855fbd288b764f2dafad5 /Lib/heapq.py | |
| parent | da1a2212c8ddbb0dfb00fc1cb1c04fce4794d9ab (diff) | |
| download | cpython-5f7617b5f634dd52e6b3995198f18dd870ef22f2.zip cpython-5f7617b5f634dd52e6b3995198f18dd870ef22f2.tar.gz cpython-5f7617b5f634dd52e6b3995198f18dd870ef22f2.tar.bz2 | |
Fixed misspelling in comment.
Diffstat (limited to 'Lib/heapq.py')
| -rw-r--r-- | Lib/heapq.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Lib/heapq.py b/Lib/heapq.py index 698e6fe..15b728a 100644 --- a/Lib/heapq.py +++ b/Lib/heapq.py @@ -218,7 +218,7 @@ def _siftdown(heap, startpos, pos): # # The total compares needed by list.sort() on the same lists were 8627, # 8627, and 8632 (this should be compared to the sum of heapify() and -# heappop() compares): list.sort() is (unsurprisingly!) more efficent +# heappop() compares): list.sort() is (unsurprisingly!) more efficient # for sorting. def _siftup(heap, pos): |