CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-23 18:11:45 +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/dart/chapter_computational_complexity/time_complexity.dart
View File

@@ -128,36 +128,36 @@ void main() {
print('输入数据大小 n = $n');
int count = constant(n);
print('常数阶的计算操作数量 = $count');
print('常数阶的操作数量 = $count');
count = linear(n);
print('线性阶的计算操作数量 = $count');
print('线性阶的操作数量 = $count');
count = arrayTraversal(List.filled(n, 0));
print('线性阶（遍历数组）的计算操作数量 = $count');
print('线性阶（遍历数组）的操作数量 = $count');
count = quadratic(n);
print('平方阶的计算操作数量 = $count');
print('平方阶的操作数量 = $count');
final nums = List.filled(n, 0);
for (int i = 0; i < n; i++) {
nums[i] = n - i; // [n,n-1,...,2,1]
}
count = bubbleSort(nums);
print('平方阶（冒泡排序）的计算操作数量 = $count');
print('平方阶（冒泡排序）的操作数量 = $count');
count = exponential(n);
print('指数阶（循环实现）的计算操作数量 = $count');
print('指数阶（循环实现）的操作数量 = $count');
count = expRecur(n);
print('指数阶（递归实现）的计算操作数量 = $count');
print('指数阶（递归实现）的操作数量 = $count');
count = logarithmic(n);
print('对数阶（循环实现）的计算操作数量 = $count');
print('对数阶（循环实现）的操作数量 = $count');
count = logRecur(n);
print('对数阶（递归实现）的计算操作数量 = $count');
print('对数阶（递归实现）的操作数量 = $count');
count = linearLogRecur(n);
print('线性对数阶（递归实现）的计算操作数量 = $count');
print('线性对数阶（递归实现）的操作数量 = $count');
count = factorialRecur(n);
print('阶乘阶（递归实现）的计算操作数量 = $count');
print('阶乘阶（递归实现）的操作数量 = $count');
}