python
diff --git a/‎.stat.json
Lines changed: 1 addition & 1 deletion b/‎.stat.json
Lines changed: 1 addition & 1 deletion
diff --git a/‎howto/sorting.po
Lines changed: 10 additions & 10 deletions b/‎howto/sorting.po
Lines changed: 10 additions & 10 deletions
@@ -1 +1 @@
-{"translation": "92.39%", "updated_at": "2024-05-17T21:09:20Z"}
+{"translation": "92.39%", "updated_at": "2024-05-24T21:08:52Z"}
@@ -17,7 +17,7 @@ msgid ""
 msgstr ""
 "Project-Id-Version: Python 3.8\n"
 "Report-Msgid-Bugs-To: \n"
-"POT-Creation-Date: 2024-05-17 17:02+0000\n"
+"POT-Creation-Date: 2024-05-24 17:08+0000\n"
 "PO-Revision-Date: 2020-05-30 11:55+0000\n"
 "Last-Translator: Rafael Fontenelle <rffontenelle@gmail.com>, 2024\n"
 "Language-Team: Chinese (China) (https://app.transifex.com/python-doc/teams/5390/zh_CN/)\n"
@@ -52,7 +52,7 @@ msgid ""
 "Python lists have a built-in :meth:`list.sort` method that modifies the list"
 " in-place.  There is also a :func:`sorted` built-in function that builds a "
 "new sorted list from an iterable."
-msgstr "内置列表方法 :meth:`list.sort` 原地修改列表，而内置函数 :func:`sorted` 由可迭代对象建出新有序列表。"
+msgstr "内置列表方法 :meth:`list.sort` 原地修改列表，而内置函数 :func:`sorted` 由可迭代对象新建有序列表。"
 
 #: ../../howto/sorting.rst:14
 msgid ""
@@ -84,7 +84,7 @@ msgstr ""
 msgid ""
 "Another difference is that the :meth:`list.sort` method is only defined for "
 "lists. In contrast, the :func:`sorted` function accepts any iterable."
-msgstr "另一个区别是 :meth:`list.sort` 方法是只为列表定义的，而 :func:`sorted` 函数接受任何可迭代对象。"
+msgstr "另一个区别是 :meth:`list.sort` 方法只为列表定义，而 :func:`sorted` 函数接受任何可迭代对象。"
 
 #: ../../howto/sorting.rst:43
 msgid "Key Functions"
@@ -118,7 +118,7 @@ msgstr "常见的模式是用对象的某一些索引作为键对复杂对象排
 #: ../../howto/sorting.rst:68
 msgid ""
 "The same technique works for objects with named attributes. For example:"
-msgstr "同样的方法也适用于有具名属性的对象。例如："
+msgstr "同样的方法对于有具名属性的对象也适用。例如："
 
 #: ../../howto/sorting.rst:87
 msgid "Operator Module Functions"
@@ -200,36 +200,36 @@ msgid ""
 "ordering already present in a dataset."
 msgstr ""
 "Python 中曾用的 `Timsort <https://en.wikipedia.org/wiki/Timsort>`_ "
-"算法利用数据集中已有的任何有序性来高效进行多种排序。"
+"算法借助数据集中任何已有的有序性来高效进行多种排序。"
 
 #: ../../howto/sorting.rst:164
 msgid "The Old Way Using Decorate-Sort-Undecorate"
 msgstr "使用装饰-排序-去装饰的旧方法"
 
 #: ../../howto/sorting.rst:166
 msgid "This idiom is called Decorate-Sort-Undecorate after its three steps:"
-msgstr "这个三个步骤被称为 Decorate-Sort-Undecorate ："
+msgstr "装饰-排序-去装饰 (Decorate-Sort-Undecorate) 得名于它的三个步骤："
 
 #: ../../howto/sorting.rst:168
 msgid ""
 "First, the initial list is decorated with new values that control the sort "
 "order."
-msgstr "首先，初始列表使用控制排序顺序的新值进行修饰。"
+msgstr "首先，用控制排序顺序的新值装饰初始列表。"
 
 #: ../../howto/sorting.rst:170
 msgid "Second, the decorated list is sorted."
-msgstr "然后，装饰列表已排序。"
+msgstr "其次，对经过装饰的列表排序。"
 
 #: ../../howto/sorting.rst:172
 msgid ""
 "Finally, the decorations are removed, creating a list that contains only the"
 " initial values in the new order."
-msgstr "最后，删除装饰，创建一个仅包含新排序中初始值的列表。"
+msgstr "最后，去除装饰即得按新顺序排列的初始值的列表。"
 
 #: ../../howto/sorting.rst:175
 msgid ""
 "For example, to sort the student data by *grade* using the DSU approach:"
-msgstr "例如，要使用DSU方法按 *grade* 对学生数据进行排序："
+msgstr "例如，用 DSU 方法按 *grade* 排序学生数据："
 
 #: ../../howto/sorting.rst:182
 msgid ""