algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08: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

22
codes/go/chapter_computational_complexity/time_complexity_test.go
View File

@ -14,35 +14,35 @@ func TestTimeComplexity(t *testing.T) {
fmt.Println("输入数据大小 n =", n)
count := constant(n)
fmt.Println("常数阶的计算操作数量 =", count)
fmt.Println("常数阶的操作数量 =", count)
count = linear(n)
fmt.Println("线性阶的计算操作数量 =", count)
fmt.Println("线性阶的操作数量 =", count)
count = arrayTraversal(make([]int, n))
fmt.Println("线性阶（遍历数组）的计算操作数量 =", count)
fmt.Println("线性阶（遍历数组）的操作数量 =", count)
count = quadratic(n)
fmt.Println("平方阶的计算操作数量 =", count)
fmt.Println("平方阶的操作数量 =", count)
nums := make([]int, n)
for i := 0; i < n; i++ {
nums[i] = n - i
}
count = bubbleSort(nums)
fmt.Println("平方阶（冒泡排序）的计算操作数量 =", count)
fmt.Println("平方阶（冒泡排序）的操作数量 =", count)
count = exponential(n)
fmt.Println("指数阶（循环实现）的计算操作数量 =", count)
fmt.Println("指数阶（循环实现）的操作数量 =", count)
count = expRecur(n)
fmt.Println("指数阶（递归实现）的计算操作数量 =", count)
fmt.Println("指数阶（递归实现）的操作数量 =", count)
count = logarithmic(float64(n))
fmt.Println("对数阶（循环实现）的计算操作数量 =", count)
fmt.Println("对数阶（循环实现）的操作数量 =", count)
count = logRecur(float64(n))
fmt.Println("对数阶（递归实现）的计算操作数量 =", count)
fmt.Println("对数阶（递归实现）的操作数量 =", count)
count = linearLogRecur(float64(n))
fmt.Println("线性对数阶（递归实现）的计算操作数量 =", count)
fmt.Println("线性对数阶（递归实现）的操作数量 =", count)
count = factorialRecur(n)
fmt.Println("阶乘阶（递归实现）的计算操作数量 =", count)
fmt.Println("阶乘阶（递归实现）的操作数量 =", count)
}