algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-26 20:04:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

Bug fixes and improvements. (#1780)

Browse Source 
* Fix the "尾递归优化" to "递归深度优化" in quick_sort.

* Update landing pages.

* Sync zh and zh-hant versions.

* Sync zh and zh-hant versions.
This commit is contained in:
Yudong Jin
2025-07-10 06:32:25 +08:00
committed by GitHub
parent 6a4d62449c
commit e8dc4736a2
43 changed files with 173 additions and 165 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
codes/python/chapter_sorting/quick_sort.py
View File

@ -79,7 +79,7 @@ class QuickSortMedian:
class QuickSortTailCall:
"""快速排序类（尾递归优化）"""
"""快速排序类（递归深度优化）"""
def partition(self, nums: list[int], left: int, right: int) -> int:
"""哨兵划分"""
@ -97,7 +97,7 @@ class QuickSortTailCall:
return i # 返回基准数的索引
def quick_sort(self, nums: list[int], left: int, right: int):
"""快速排序（尾递归优化）"""
"""快速排序（递归深度优化）"""
# 子数组长度为 1 时终止
while left < right:
# 哨兵划分操作
@ -123,7 +123,7 @@ if __name__ == "__main__":
QuickSortMedian().quick_sort(nums1, 0, len(nums1) - 1)
print("快速排序（中位基准数优化）完成后 nums =", nums1)
# 快速排序（尾递归优化）
# 快速排序（递归深度优化）
nums2 = [2, 4, 1, 0, 3, 5]
QuickSortTailCall().quick_sort(nums2, 0, len(nums2) - 1)
print("快速排序（尾递归优化）完成后 nums =", nums2)
print("快速排序（递归深度优化）完成后 nums =", nums2)