algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-11 09:30:53 +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/cpp/chapter_computational_complexity/time_complexity.cpp
View File

@ -132,37 +132,37 @@ int main() {
cout << "输入数据大小 n = " << n << endl;
int count = constant(n);
cout << "常数阶的计算操作数量 = " << count << endl;
cout << "常数阶的操作数量 = " << count << endl;
count = linear(n);
cout << "线性阶的计算操作数量 = " << count << endl;
cout << "线性阶的操作数量 = " << count << endl;
vector<int> arr(n);
count = arrayTraversal(arr);
cout << "线性阶（遍历数组）的计算操作数量 = " << count << endl;
cout << "线性阶（遍历数组）的操作数量 = " << count << endl;
count = quadratic(n);
cout << "平方阶的计算操作数量 = " << count << endl;
cout << "平方阶的操作数量 = " << count << endl;
vector<int> nums(n);
for (int i = 0; i < n; i++)
nums[i] = n - i; // [n,n-1,...,2,1]
count = bubbleSort(nums);
cout << "平方阶（冒泡排序）的计算操作数量 = " << count << endl;
cout << "平方阶（冒泡排序）的操作数量 = " << count << endl;
count = exponential(n);
cout << "指数阶（循环实现）的计算操作数量 = " << count << endl;
cout << "指数阶（循环实现）的操作数量 = " << count << endl;
count = expRecur(n);
cout << "指数阶（递归实现）的计算操作数量 = " << count << endl;
cout << "指数阶（递归实现）的操作数量 = " << count << endl;
count = logarithmic((float)n);
cout << "对数阶（循环实现）的计算操作数量 = " << count << endl;
cout << "对数阶（循环实现）的操作数量 = " << count << endl;
count = logRecur((float)n);
cout << "对数阶（递归实现）的计算操作数量 = " << count << endl;
cout << "对数阶（递归实现）的操作数量 = " << count << endl;
count = linearLogRecur((float)n);
cout << "线性对数阶（递归实现）的计算操作数量 = " << count << endl;
cout << "线性对数阶（递归实现）的操作数量 = " << count << endl;
count = factorialRecur(n);
cout << "阶乘阶（递归实现）的计算操作数量 = " << count << endl;
cout << "阶乘阶（递归实现）的操作数量 = " << count << endl;
return 0;
}