Jan 27, 2026 · Jan 27, 2026 · Jan 27, 2026 · Jan 27, 2026 · Jan 27, 2026 · Jan 28, 2026
diff --git a/Doc/howto/sorting.rst b/Doc/howto/sorting.rst
 ==============

 A simple ascending sort is very easy: just call the :func:`sorted` function. It
 returns a new sorted list:
 returns a new sorted list and does not modify the original.

 If you do not store or otherwise use the return value, the sorted result is
 lost:

 .. doctest::

    >>> sorted([5, 2, 3, 1, 4])
    >>> integers = [5, 2, 3, 1, 4]
    >>> sorted_integers = sorted(integers)
    >>> sorted_integers
    [1, 2, 3, 4, 5]

 You can also use the :meth:`list.sort` method. It modifies the list
Original file line number	Diff line number	Diff line change
Expand Up		@@ -17,11 +17,16 @@ Sorting Basics
		==============

		A simple ascending sort is very easy: just call the :func:`sorted` function. It
		returns a new sorted list:
		returns a new sorted list and does not modify the original.
Copy link Member skirpichevJan 28, 2026 Choose a reason for hiding this comment The reason will be displayed to describe this comment to others.Learn more. IMO, it's useless. HOWTO already very clear here and sorted docs also: Return a new sorted list from the items in iterable.

		If you do not store or otherwise use the return value, the sorted result is
		lost:
Comment on lines +22 to +23 Copy link Member skirpichevJan 28, 2026 Choose a reason for hiding this comment The reason will be displayed to describe this comment to others.Learn more. It's also redundant, given above sentence. No need to explain every basic language feature in the HOWTO. We have the Tutorial for this.

		.. doctest::

		>>> sorted([5, 2, 3, 1, 4])
		>>> integers = [5, 2, 3, 1, 4]
		>>> sorted_integers = sorted(integers)
		>>> sorted_integers
		[1, 2, 3, 4, 5]

		You can also use the :meth:`list.sort` method. It modifies the list
Expand Down