diff options
| author | Andre Delfino <adelfino@gmail.com> | 2020-09-15 20:13:26 (GMT) |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2020-09-15 20:13:26 (GMT) |
| commit | ac0333e1e117b7f61ed7ef1dbcdb6e515ada603b (patch) | |
| tree | 778d25829c59eb1c2c2b8e1461b50b87ba9ee900 /Lib/heapq.py | |
| parent | 5a565b3d7c31f9f402306a9bd58df36e4fe66ba4 (diff) | |
| download | cpython-ac0333e1e117b7f61ed7ef1dbcdb6e515ada603b.zip cpython-ac0333e1e117b7f61ed7ef1dbcdb6e515ada603b.tar.gz cpython-ac0333e1e117b7f61ed7ef1dbcdb6e515ada603b.tar.bz2 | |
Fix all Python Cookbook links (#22205)
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 fabefd8..5895562 100644 --- a/Lib/heapq.py +++ b/Lib/heapq.py @@ -456,7 +456,7 @@ def merge(*iterables, key=None, reverse=False): # 2) Made multiple passes over the data. # 3) Made more comparisons in common cases (small k, large n, semi-random input). # See the more detailed comparison of approach at: -# http://code.activestate.com/recipes/577573-compare-algorithms-for-heapqsmallest +# https://github.com/ActiveState/code/tree/master/recipes/Python/577573_Compare_algorithms/recipe-577573.py def nsmallest(n, iterable, key=None): """Find the n smallest elements in a dataset. |