Let library modules use the new keyword arguments for list.sort().

1 files changed, 4 insertions, 8 deletions

diff --git a/Lib/difflib.py b/Lib/difflib.py
index a45c0bc..699845c 100644
--- a/Lib/difflib.py
+++ b/Lib/difflib.py
@@ -701,15 +701,11 @@ def get_close_matches(word, possibilities, n=3, cutoff=0.6):
            s.quick_ratio() >= cutoff and \
            s.ratio() >= cutoff:
             result.append((s.ratio(), x))
-    # Sort by score.
-    result.sort()
-    # Retain only the best n.
-    result = result[-n:]
-    # Move best-scorer to head of list.
-    result.reverse()
-    # Strip scores.
-    return [x for score, x in result]
 
+    # Move the best scorers to head of list
+    result.sort(reverse=True)
+    # Strip scores for the best n matches
+    return [x for score, x in result[:n]]
 
 def _count_leading(line, ch):
     """