1.多维数组
let arr3 = [
[
[
[
[
[11, 12, 13],
[21, 22, 26],
[36, 37, 38],
[66, 99, 88]
]
]
]
]
];
for (let i = 0; i < arr3.length; i++) {
for (let j = 0; j < arr3[i].length; j++) {
for (let k = 0; k < arr3[i][j].length; k++) {
for (let z = 0; z < arr3[i][j][k].length; z++) {
for (let m = 0; m < arr3[i][j][k][z].length; m++) {
for (let n = 0; n < arr3[i][j][k][z][m].length; n++){
console.log(arr3[i][j][k][z][m][n]);
}
}
}
}
}
}
2.冒泡算法
let arr = [3, 9, 5, 1, 8, 2]
for (let i = 0; i < arr.length - 1; i++) {
for (let j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
let num = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = num;
}
}
}
console.log(arr);