冒泡算法的总结
function bubbleSort(arr) {
let n = 0
const len = arr.length
for(let i = 0; i < len;i++) {
n++
if(arr[i] > arr[i+1]) {
let temp = arr[i]
arr[i] = arr[i+1]
arr[i+1] = temp
}
}
console.log(n)
return arr
}
function bubbleSort(arr) {
let n = 0
const len = arr.length -1
for(let i = 0; i < len;i++) {
for(let j = 0; j < len-i;j++) {
if(arr[j] > arr[j+1]) {
let temp = arr[j]
arr[j] = arr[j + 1]
arr[j + 1] = temp
}
}
}
console.log(n)
return arr
}
function bubbleSort(arr) {
const len = arr.length - 1
let flag
for(let i = 0; i < len; i++) {
flag = false
for(let j = len; j >i; j--) {
if(arr[j] < arr[j-1]) {
flag = true
let tmp = arr[j-1]
arr[j-1] = arr[j]
arr[j] = tmp
}
}
if(!flag) {
break
}
}
return arr
}
const arr = [3,8,9,10,6,4]
console.log(bubbleSort(arr))