algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 04:31:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fomrat the JS and TS codes with prettier.

Browse Source
This commit is contained in:
krahets
2023-04-17 21:58:11 +08:00
parent 9a98ff8a5e
commit c4ea4e39f3
68 changed files with 634 additions and 510 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/javascript/chapter_computational_complexity/space_complexity.js
View File

@ -57,7 +57,9 @@ function linearRecur(n) {
/* 平方阶 */
function quadratic(n) {
// 矩阵占用 O(n^2) 空间
const numMatrix = Array(n).fill(null).map(() => Array(n).fill(null));
const numMatrix = Array(n)
.fill(null)
.map(() => Array(n).fill(null));
// 二维列表占用 O(n^2) 空间
const numList = [];
for (let i = 0; i < n; i++) {

24
codes/javascript/chapter_computational_complexity/time_complexity.js
View File

@ -121,35 +121,35 @@ function factorialRecur(n) {
/* Driver Code */
// 可以修改 n 运行，体会一下各种复杂度的操作数量变化趋势
const n = 8;
console.log("输入数据大小 n = " + n);
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);

6
codes/javascript/chapter_computational_complexity/worst_best_time_complexity.js
View File

@ -38,8 +38,6 @@ for (let i = 0; i < 10; i++) {
const n = 100;
const nums = randomNumbers(n);
const index = findOne(nums);
console.log(
"\n数组 [ 1, 2, ..., n ] 被打乱后 = [" + nums.join(", ") + "]"
);
console.log("数字 1 的索引为 " + index);
console.log('\n数组 [ 1, 2, ..., n ] 被打乱后 = [' + nums.join(', ') + ']');
console.log('数字 1 的索引为 ' + index);
}