Fix link in programming FAQ.

The example actually uses the sort method of list object.

diff --git a/Doc/faq/programming.rst b/Doc/faq/programming.rst
index 8157124cda422ba56b64c603d96dff4a37bde95f..b2ad7a7cc400d3e27d68214558e90a6b728738ae 100644 (file)
--- a/Doc/faq/programming.rst
+++ b/Doc/faq/programming.rst
@@ -1312,7 +1312,7 @@ I want to do a complicated sort: can you do a Schwartzian Transform in Python?
 
 The technique, attributed to Randal Schwartz of the Perl community, sorts the
 elements of a list by a metric which maps each element to its "sort value". In
-Python, use the ``key`` argument for the :func:`sort()` function::
+Python, use the ``key`` argument for the :meth:`list.sort` method::
 
    Isorted = L[:]
    Isorted.sort(key=lambda s: int(s[10:15]))