summaryrefslogtreecommitdiff
path: root/Lib/heapq.py
diff options
context:
space:
mode:
authorRaymond Hettinger <python@rcn.com>2014-06-14 00:03:28 -0700
committerRaymond Hettinger <python@rcn.com>2014-06-14 00:03:28 -0700
commitb321e79123595cb24ac9b0b48d36b19f7051d076 (patch)
treef1e5b8f14c76c789015960db9e4ddd8001d6ea41 /Lib/heapq.py
parentcd41e89377940b2c3e0267df2ea0b84c27ae453b (diff)
downloadcpython-git-b321e79123595cb24ac9b0b48d36b19f7051d076.tar.gz
Fix typo
Diffstat (limited to 'Lib/heapq.py')
-rw-r--r--Lib/heapq.py2
1 files changed, 1 insertions, 1 deletions
diff --git a/Lib/heapq.py b/Lib/heapq.py
index 5ab68b010a..b20f04de31 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:
# -----------------------------------------------