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

Update the book based on the revised second edition (#1014)

Browse Source 
* Revised the book

* Update the book with the second revised edition

* Revise base on the manuscript of the first edition
This commit is contained in:
Yudong Jin
2023-12-28 18:06:09 +08:00
committed by GitHub
parent 19dde675df
commit f68bbb0d59
261 changed files with 643 additions and 647 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
codes/rust/chapter_sorting/bubble_sort.rs
View File

@@ -37,7 +37,7 @@ fn bubble_sort_with_flag(nums: &mut [i32]) {
flag = true; // 记录交换元素
}
}
if !flag {break}; // 此轮冒泡未交换任何元素，直接跳出
if !flag {break}; // 此轮“冒泡”未交换任何元素，直接跳出
}
}

4
codes/rust/chapter_sorting/merge_sort.rs
View File

@@ -6,13 +6,13 @@
/* 合并左子数组和右子数组 */
fn merge(nums: &mut [i32], left: usize, mid: usize, right: usize) {
// 左子数组区间 [left, mid], 右子数组区间 [mid+1, right]
// 左子数组区间为 [left, mid], 右子数组区间为 [mid+1, right]
// 创建一个临时数组 tmp ，用于存放合并后的结果
let tmp_size = right - left + 1;
let mut tmp = vec![0; tmp_size];
// 初始化左子数组和右子数组的起始索引
let (mut i, mut j, mut k) = (left, mid + 1, 0);
// 当左右子数组都还有元素时，比较并将较小的元素复制到临时数组中
// 当左右子数组都还有元素时，进行比较并将较小的元素复制到临时数组中
while i <= mid && j <= right {
if nums[i] <= nums[j] {
tmp[k] = nums[j];

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

@@ -44,7 +44,7 @@ impl QuickSort {
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