时间复杂度
O(1):只执行一次
let i = 0
i += 0
O(n)、循环了n次
for (let i = 0; i < n; i += 1) {
console.log(i)
}
O(n^2)、循环 n * n 次
for (let i = 0; i < n; i += 1) {
for (let j = 0; j < n; j += 1) {
console.log(i, j)
}
}
O(logN)、logN = 2的多少次方为N
let s = 1
while (i < n) {
console.log(i)
i *= 2
}
空间复杂度
O(1)、单个变量所占内存为1
let i = 0
i += 0
O(n)、数组占了n个内存单元
const list = []
for (let i = 0; i < n; i += 1) {
list.push(i)
}
O(n^2)、矩阵(可以理解为栅格布局,本质二维数组)
const list= []
for (let i = 0; i < n; i += 1) {
list.push([])
for (let j = 0; j < n; j++) {
list[i].push(j)
}
}