diff options
| author | Raymond Hettinger <python@rcn.com> | 2014-06-14 07:03:28 (GMT) |
|---|---|---|
| committer | Raymond Hettinger <python@rcn.com> | 2014-06-14 07:03:28 (GMT) |
| commit | b321e79123595cb24ac9b0b48d36b19f7051d076 (patch) | |
| tree | f1e5b8f14c76c789015960db9e4ddd8001d6ea41 /Lib/heapq.py | |
| parent | cd41e89377940b2c3e0267df2ea0b84c27ae453b (diff) | |
| download | cpython-b321e79123595cb24ac9b0b48d36b19f7051d076.zip cpython-b321e79123595cb24ac9b0b48d36b19f7051d076.tar.gz cpython-b321e79123595cb24ac9b0b48d36b19f7051d076.tar.bz2 | |
Fix typo
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 5ab68b0..b20f04d 100644 --- a/Lib/heapq.py +++ b/Lib/heapq.py @@ -430,7 +430,7 @@ def merge(*iterables, key=None, reverse=False): # # Combining and simplifying for a rough estimate gives: # -# comparisons = n + k * (log(k, 2) * log(n/k)) + log(k, 2) + log(n/k)) +# comparisons = n + k * (log(k, 2) * log(n/k) + log(k, 2) + log(n/k)) # # Computing the number of comparisons for step 3: # ----------------------------------------------- |