xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-12 11:50:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

Polish the chapter

Browse Source 
introduction, computational complexity.
This commit is contained in:
krahets
2023-08-20 14:51:39 +08:00
parent 5fb728b3d6
commit 2626de8d0b
87 changed files with 375 additions and 371 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/swift/chapter_computational_complexity/time_complexity.swift
+11 -11
View File
@@ -140,33 +140,33 @@ enum TimeComplexity {
print("输入数据大小 n = \(n)")
var count = constant(n: n)
print("常数阶的计算操作数量 = \(count)")
print("常数阶的操作数量 = \(count)")
count = linear(n: n)
print("线性阶的计算操作数量 = \(count)")
print("线性阶的操作数量 = \(count)")
count = arrayTraversal(nums: Array(repeating: 0, count: n))
print("线性阶（遍历数组）的计算操作数量 = \(count)")
print("线性阶（遍历数组）的操作数量 = \(count)")
count = quadratic(n: n)
print("平方阶的计算操作数量 = \(count)")
print("平方阶的操作数量 = \(count)")
var nums = Array(stride(from: n, to: 0, by: -1)) // [n,n-1,...,2,1]
count = bubbleSort(nums: &nums)
print("平方阶（冒泡排序）的计算操作数量 = \(count)")
print("平方阶（冒泡排序）的操作数量 = \(count)")
count = exponential(n: n)
print("指数阶（循环实现）的计算操作数量 = \(count)")
print("指数阶（循环实现）的操作数量 = \(count)")
count = expRecur(n: n)
print("指数阶（递归实现）的计算操作数量 = \(count)")
print("指数阶（递归实现）的操作数量 = \(count)")
count = logarithmic(n: Double(n))
print("对数阶（循环实现）的计算操作数量 = \(count)")
print("对数阶（循环实现）的操作数量 = \(count)")
count = logRecur(n: Double(n))
print("对数阶（递归实现）的计算操作数量 = \(count)")
print("对数阶（递归实现）的操作数量 = \(count)")
count = linearLogRecur(n: Double(n))
print("线性对数阶（递归实现）的计算操作数量 = \(count)")
print("线性对数阶（递归实现）的操作数量 = \(count)")
count = factorialRecur(n: n)
print("阶乘阶（递归实现）的计算操作数量 = \(count)")
print("阶乘阶（递归实现）的操作数量 = \(count)")
}
}
codes/swift/chapter_heap/my_heap.swift
+2 -2
View File
@@ -69,7 +69,7 @@ class MaxHeap {
while true {
// 获取节点 i 的父节点
let p = parent(i: i)
// 当“越过根节点”或“节点无需修复”时，结束堆化
// 当“越过根节点”或“节点无须修复”时，结束堆化
if p < 0 || maxHeap[i] <= maxHeap[p] {
break
}
@@ -110,7 +110,7 @@ class MaxHeap {
if r < size(), maxHeap[r] > maxHeap[ma] {
ma = r
}
// 若节点 i 最大或索引 l, r 越界，则无需继续堆化，跳出
// 若节点 i 最大或索引 l, r 越界，则无须继续堆化，跳出
if ma == i {
break
}
codes/swift/chapter_sorting/heap_sort.swift
+1 -1
View File
@@ -18,7 +18,7 @@ func siftDown(nums: inout [Int], n: Int, i: Int) {
if r < n, nums[r] > nums[ma] {
ma = r
}
// 若节点 i 最大或索引 l, r 越界，则无需继续堆化，跳出
// 若节点 i 最大或索引 l, r 越界，则无须继续堆化，跳出
if ma == i {
break
}
codes/swift/chapter_tree/avl_tree.swift
+1 -1
View File
@@ -84,7 +84,7 @@ class AVLTree {
return leftRotate(node: node)
}
}
// 平衡树，无需旋转，直接返回
// 平衡树，无须旋转，直接返回
return node
}