algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-07 15:01:58 +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/javascript/chapter_computational_complexity/time_complexity.js
View File

@ -124,32 +124,32 @@ const n = 8;
console.log('输入数据大小 n = ' + n);
let count = constant(n);
console.log('常数阶的计算操作数量 = ' + count);
console.log('常数阶的操作数量 = ' + count);
count = linear(n);
console.log('线性阶的计算操作数量 = ' + count);
console.log('线性阶的操作数量 = ' + count);
count = arrayTraversal(new Array(n));
console.log('线性阶（遍历数组）的计算操作数量 = ' + count);
console.log('线性阶（遍历数组）的操作数量 = ' + count);
count = quadratic(n);
console.log('平方阶的计算操作数量 = ' + count);
console.log('平方阶的操作数量 = ' + count);
let nums = new Array(n);
for (let i = 0; i < n; i++) nums[i] = n - i; // [n,n-1,...,2,1]
count = bubbleSort(nums);
console.log('平方阶（冒泡排序）的计算操作数量 = ' + count);
console.log('平方阶（冒泡排序）的操作数量 = ' + count);
count = exponential(n);
console.log('指数阶（循环实现）的计算操作数量 = ' + count);
console.log('指数阶（循环实现）的操作数量 = ' + count);
count = expRecur(n);
console.log('指数阶（递归实现）的计算操作数量 = ' + count);
console.log('指数阶（递归实现）的操作数量 = ' + count);
count = logarithmic(n);
console.log('对数阶（循环实现）的计算操作数量 = ' + count);
console.log('对数阶（循环实现）的操作数量 = ' + count);
count = logRecur(n);
console.log('对数阶（递归实现）的计算操作数量 = ' + count);
console.log('对数阶（递归实现）的操作数量 = ' + count);
count = linearLogRecur(n);
console.log('线性对数阶（递归实现）的计算操作数量 = ' + count);
console.log('线性对数阶（递归实现）的操作数量 = ' + count);
count = factorialRecur(n);
console.log('阶乘阶（递归实现）的计算操作数量 = ' + count);
console.log('阶乘阶（递归实现）的操作数量 = ' + count);