#8267: Use sorted() to get a sorted list of dict keys.
diff --git a/Doc/tutorial/controlflow.rst b/Doc/tutorial/controlflow.rst
index a9247cd..a30d49c 100644
--- a/Doc/tutorial/controlflow.rst
+++ b/Doc/tutorial/controlflow.rst
@@ -431,9 +431,9 @@
print "-- I'm sorry, we're all out of", kind
for arg in arguments: print arg
print "-" * 40
- keys = keywords.keys()
- keys.sort()
- for kw in keys: print kw, ":", keywords[kw]
+ keys = sorted(keywords.keys())
+ for kw in keys:
+ print kw, ":", keywords[kw]
It could be called like this::
diff --git a/Doc/tutorial/datastructures.rst b/Doc/tutorial/datastructures.rst
index dfc2b33..cbf3491 100644
--- a/Doc/tutorial/datastructures.rst
+++ b/Doc/tutorial/datastructures.rst
@@ -481,8 +481,8 @@
The :meth:`keys` method of a dictionary object returns a list of all the keys
used in the dictionary, in arbitrary order (if you want it sorted, just apply
-the :meth:`sort` method to the list of keys). To check whether a single key is
-in the dictionary, use the :keyword:`in` keyword.
+the :func:`sorted` function to it). To check whether a single key is in the
+dictionary, use the :keyword:`in` keyword.
Here is a small example using a dictionary::