Fix errors found by "make suspicious".

1 files changed, 7 insertions, 7 deletions

diff --git a/Doc/library/functions.rst b/Doc/library/functions.rst
index 4f1c91ca08..97f2a38d41 100644
--- a/Doc/library/functions.rst
+++ b/Doc/library/functions.rst
@@ -634,9 +634,9 @@ are always available.  They are listed here in alphabetical order.
    The optional keyword-only *key* argument specifies a one-argument ordering
    function like that used for :meth:`list.sort`.
 
-   If multiple items are maximal, the function returns the first one encountered.
-   This is consistent with other sort-stability preserving tools such as
-   ``sorted(iterable, key=keyfunc, reverse=True)[0]` and
+   If multiple items are maximal, the function returns the first one
+   encountered.  This is consistent with other sort-stability preserving tools
+   such as ``sorted(iterable, key=keyfunc, reverse=True)[0]`` and
    ``heapq.nlargest(1, iterable, key=keyfunc)``.
 
 .. function:: memoryview(obj)
@@ -655,10 +655,10 @@ are always available.  They are listed here in alphabetical order.
    The optional keyword-only *key* argument specifies a one-argument ordering
    function like that used for :meth:`list.sort`.
 
-   If multiple items are minimal, the function returns the first one encountered.
-   This is consistent with other sort-stability preserving tools such as
-   ``sorted(iterable, key=keyfunc)[0]` and
-   ``heapq.nsmallest(1, iterable, key=keyfunc)``.
+   If multiple items are minimal, the function returns the first one
+   encountered.  This is consistent with other sort-stability preserving tools
+   such as ``sorted(iterable, key=keyfunc)[0]`` and ``heapq.nsmallest(1,
+   iterable, key=keyfunc)``.
 
 .. function:: next(iterator[, default])