algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-03 05:27:55 +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/go/chapter_sorting/bubble_sort.go
View File

@ -31,7 +31,7 @@ func bubbleSortWithFlag(nums []int) {
flag = true // 记录交换元素
}
}
if flag == false { // 此轮冒泡未交换任何元素，直接跳出
if flag == false { // 此轮“冒泡”未交换任何元素，直接跳出
break
}
}

4
codes/go/chapter_sorting/merge_sort.go
View File

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

2
codes/go/chapter_sorting/quick_sort.go
View File

@ -45,7 +45,7 @@ func (q *quickSort) quickSort(nums []int, left, right int) {
q.quickSort(nums, pivot+1, right)
}
/* 选取三个元素的中位数 */
/* 选取三个候选元素的中位数 */
func (q *quickSortMedian) medianThree(nums []int, left, mid, right int) int {
// 此处使用异或运算来简化代码（!= 在这里起到异或的作用）
// 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1