快速排序
function swift(arr) {
if (arr.length <= 1) {
return arr;
}
var middle = parseInt(arr.length / 2);
var arrleft = [],
arrright = [];
for (let i = 0; i < arr.length; i++) {
if (i == middle) {
continue;
}
arr[i] < arr[middle] ? arrleft.push(arr[i]) : arrright.push(arr[i])
}
return swift(arrleft).concat(arr[middle], swift(arrright))
}
冒泡排序
function buuble(arr) {
let t;
for (let i = 0; i < arr.length - 1; i++) {
for (let j = 0; j < arr.length - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
t = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = t;
}
}
}
return arr
}
插入排序
function insert(arr) {
for (let i = 1; i < arr.length; i++) {
//当前元素比已排好序的最大元素小时 才进入排序
if (arr[i] < arr[i - 1]) {
let curnum = arr[i];
for (let j = i; j >= 0; j--) {
if (curnum < arr[j - 1] && j > 0) {
arr[j] = arr[j - 1]
} else {
arr[j] = curnum;
break;
}
}
}
}
return arr
}