前端工作中常用到的算法之一:冒泡排序法
直接上代码
this.textFun()
methods: {
textFun() {
const arr = [1,2,8,5,3,2]
for (let i = 0; i < arr.length-1; i++) {
for (let y = 0; y < arr.length-1-i; y++) {
if (arr[y] > arr[y+1]) {
const temp = arr[y]
arr[y] = arr[y+1]
arr[y+1] = temp
}
}
}
console.log(arr)
},
}