algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-10-31 18:37:48 +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
zh-hant/codes/ruby/chapter_sorting/quick_sort.rb
View File

@ -92,7 +92,7 @@ class QuickSortMedian
end
end
### 快速排序類別（尾遞迴最佳化）###
### 快速排序類別（遞迴深度最佳化）###
class QuickSortTailCall
class << self
### 哨兵劃分 ###
@ -115,7 +115,7 @@ class QuickSortTailCall
i # 返回基準數的索引
end
### 快速排序（尾遞迴最佳化）###
### 快速排序（遞迴深度最佳化）###
def quick_sort(nums, left, right)
# 子陣列長度不為 1 時遞迴
while left < right
@ -146,8 +146,8 @@ if __FILE__ == $0
QuickSortMedian.quick_sort(nums1, 0, nums1.length - 1)
puts "快速排序（中位基準數最佳化）完成後 nums1 = #{nums1}"
# 快速排序（尾遞迴最佳化）
# 快速排序（遞迴深度最佳化）
nums2 = [2, 4, 1, 0, 3, 5]
QuickSortTailCall.quick_sort(nums2, 0, nums2.length - 1)
puts "快速排序（尾遞迴最佳化）完成後 nums2 = #{nums2}"
puts "快速排序（遞迴深度最佳化）完成後 nums2 = #{nums2}"
end