冒泡排序簡單來說是把大數往後面放:
let mpsort = (arr) => {
for(let i = arr.length; i > 0; i--){
for(let j = 0; j < i; j++){
if(arr[j]>arr[j+1]){
let num = arr[j+1]
arr[j+1] = arr[j]
arr[j] = num
}
}
}
return arr
}
選擇排序簡單來說是把小數往前拿:
let choicesort = (arr) => {
for(let i = 0; i<arr.length ; i++){
let num = arr[i]
for(let j = i+1; j<arr.length ; j++){
if(arr[j]<num){
let min = num;
num = arr[j];
arr[j] = min;
}
arr[i] = num
}
}
return arr
}
兩者的時間複雜度都是o(n2)