fuhouyin/hello-algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix: predicate

Browse Source
This commit is contained in:
nuomi1 2023-01-08 23:48:35 +08:00
parent 5e23c75870
commit e6021ff59e
No known key found for this signature in database
GPG Key ID: E410D5FF602FBF25
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
codes/swift/chapter_computational_complexity/time_complexity.swift
View File

@ -49,7 +49,7 @@ func quadratic(n: Int) -> Int {
func bubbleSort(nums: inout [Int]) -> Int { func bubbleSort(nums: inout [Int]) -> Int {
var count = 0 // 计数器 var count = 0 // 计数器
// 外循环：待排序元素数量为 n-1, n-2, ..., 1 // 外循环：待排序元素数量为 n-1, n-2, ..., 1
for i in sequence(first: nums.count - 1, next: { $0 > 0 ? $0 - 1 : nil }) { for i in sequence(first: nums.count - 1, next: { $0 > 0 + 1 ? $0 - 1 : nil }) {
// 内循环：冒泡操作 // 内循环：冒泡操作
for j in 0 ..< i { for j in 0 ..< i {
if nums[j] > nums[j + 1] { if nums[j] > nums[j + 1] {
@ -149,7 +149,7 @@ enum TimeComplexity {
count = quadratic(n: n) count = quadratic(n: n)
print("平方阶的计算操作数量 = \(count)") print("平方阶的计算操作数量 = \(count)")
var nums = Array(sequence(first: n, next: { $0 > 0 ? $0 - 1 : nil })) // [n,n-1,...,2,1] var nums = Array(sequence(first: n, next: { $0 > 0 + 1 ? $0 - 1 : nil })) // [n,n-1,...,2,1]
count = bubbleSort(nums: &nums) count = bubbleSort(nums: &nums)
print("平方阶（冒泡排序）的计算操作数量 = \(count)") print("平方阶（冒泡排序）的计算操作数量 = \(count)")

2
docs/chapter_computational_complexity/time_complexity.md
View File

@ -1481,7 +1481,7 @@ $$
func bubbleSort(nums: inout [Int]) -> Int { func bubbleSort(nums: inout [Int]) -> Int {
var count = 0 // 计数器 var count = 0 // 计数器
// 外循环：待排序元素数量为 n-1, n-2, ..., 1 // 外循环：待排序元素数量为 n-1, n-2, ..., 1
for i in sequence(first: nums.count - 1, next: { $0 > 0 ? $0 - 1 : nil }) { for i in sequence(first: nums.count - 1, next: { $0 > 0 + 1 ? $0 - 1 : nil }) {
// 内循环：冒泡操作 // 内循环：冒泡操作
for j in 0 ..< i { for j in 0 ..< i {
if nums[j] > nums[j + 1] { if nums[j] > nums[j + 1] {