algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-30 05:43:10 +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/rust/chapter_sorting/quick_sort.rs
View File

@ -90,7 +90,7 @@ impl QuickSortMedian {
}
}
/* 快速排序（尾递归优化） */
/* 快速排序（递归深度优化） */
struct QuickSortTailCall;
impl QuickSortTailCall {
@ -111,7 +111,7 @@ impl QuickSortTailCall {
i // 返回基准数的索引
}
/* 快速排序（尾递归优化） */
/* 快速排序（递归深度优化） */
pub fn quick_sort(mut left: i32, mut right: i32, nums: &mut [i32]) {
// 子数组长度为 1 时终止
while left < right {
@ -141,8 +141,8 @@ fn main() {
QuickSortMedian::quick_sort(0, (nums.len() - 1) as i32, &mut nums);
println!("快速排序（中位基准数优化）完成后 nums = {:?}", nums);
/* 快速排序（尾递归优化） */
/* 快速排序（递归深度优化） */
let mut nums = [2, 4, 1, 0, 3, 5];
QuickSortTailCall::quick_sort(0, (nums.len() - 1) as i32, &mut nums);
println!("快速排序（尾递归优化）完成后 nums = {:?}", nums);
println!("快速排序（递归深度优化）完成后 nums = {:?}", nums);
}