xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-10 14:36:06 +00: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
codes/swift/chapter_sorting/bubble_sort.swift
+1 -1
View File
@@ -34,7 +34,7 @@ func bubbleSortWithFlag(nums: inout [Int]) {
flag = true // 记录交换元素
}
}
if !flag { // 此轮冒泡未交换任何元素，直接跳出
if !flag { // 此轮“冒泡”未交换任何元素，直接跳出
break
}
}
codes/swift/chapter_sorting/merge_sort.swift
+2 -2
View File
@@ -6,12 +6,12 @@
/* 合并左子数组和右子数组 */
func merge(nums: inout [Int], left: Int, mid: Int, right: Int) {
// 左子数组区间 [left, mid], 右子数组区间 [mid+1, right]
// 左子数组区间为 [left, mid], 右子数组区间为 [mid+1, right]
// 创建一个临时数组 tmp ，用于存放合并后的结果
var tmp = Array(repeating: 0, count: right - left + 1)
// 初始化左子数组和右子数组的起始索引
var i = left, j = mid + 1, k = 0
// 当左右子数组都还有元素时，比较并将较小的元素复制到临时数组中
// 当左右子数组都还有元素时，进行比较并将较小的元素复制到临时数组中
while i <= mid, j <= right {
if nums[i] <= nums[j] {
tmp[k] = nums[i]
codes/swift/chapter_sorting/quick_sort.swift
+1 -1
View File
@@ -45,7 +45,7 @@ func quickSort(nums: inout [Int], left: Int, right: Int) {
/* 快速排序类（中位基准数优化） */
/* 选取三个元素的中位数 */
/* 选取三个候选元素的中位数 */
func medianThree(nums: [Int], left: Int, mid: Int, right: Int) -> Int {
if (nums[left] < nums[mid]) != (nums[left] < nums[right]) {
return left