CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-29 13:00:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix the median_three mehod for quick sort (#1134)

Browse Source 
* Add the section of terminologies.

* fix format

* Fix median_three function for quick sort

* Delete docs/chapter_appendix/terminologies.md

* Update quick_sort.ts

* Update quick_sort.rs

* Update quick_sort.js
This commit is contained in:
Yudong Jin
2024-03-15 01:06:59 +08:00
committed by GitHub
parent 644eaf99ff
commit 9769e14017
12 changed files with 83 additions and 93 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
codes/rust/chapter_sorting/quick_sort.rs
View File

@@ -46,13 +46,13 @@ struct QuickSortMedian;
impl QuickSortMedian {
/* 选取三个候选元素的中位数 */
fn median_three(nums: &mut [i32], left: usize, mid: usize, right: usize) -> usize {
// 此处使用异或运算来简化代码
// 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1
if (nums[left] < nums[mid]) ^ (nums[left] < nums[right]) {
return left;
} else if (nums[mid] < nums[left]) ^ (nums[mid] < nums[right]) {
return mid;
}
let (mut l, mut m, mut r) = (nums[left], nums[mid], nums[right]);
if ((l <= m && m <= r) || (r <= m && m <= l)) {
return mid; // m 在 l 和 r 之间
}
if ((m <= l && l <= r) || (r <= l && l <= m)) {
return left; // l 在 m 和 r 之间
}
right
}
@@ -73,8 +73,8 @@ impl QuickSortMedian {
}
nums.swap(i, j); // 交换这两个元素
}
nums.swap(i, left); // 将基准数交换至两子数组的分界线
i // 返回基准数的索引
nums.swap(i, left); // 将基准数交换至两子数组的分界线
i // 返回基准数的索引
}
/* 快速排序 */