js实现常用排序算法

//选择排序

function selectSort(arr) {
let resurt = [];
while(arr.length){
let min = 0;
for(let j in arr){
if(arr[min] >arr[j]){
min = j;
}
}
resurt.push(…arr.splice(min,1));
}
console.log(resurt);
return resurt;
}
let arr = [4,2,3,1,5];

selectSort(arr);

//冒泡排序

function bubbleSort(arr) {
let len = arr.length;
for(let i = 0;i<len-1;i++){
for(let j = 0;j<len - i -1;j++){
if(arr[j]>arr[j+1]){
[arr[j+1],arr[j]] = [arr[j],arr[j+1]];
}
}
}
return arr;
}

var arr=[1,3,5,12,14,8,99];
var result=bubbleSort(arr);
console.log(result); //[1, 3, 5, 8, 12, 14, 99]

//快速排序
function quickSort(arr) {
if(arr.length<2){
return arr
}else{
let base = arr[0];
let less = arr.filter((item)=>item<base);
let bigger = arr.filter((item)=>item>base);
return quickSort(less).concat([base].concat(quickSort(bigger)));
}
}
let arr = [4,2,3,1,5];

let result = quickSort(arr);
console.log(result);

//插入排序

function insertSort(arr) {
for(let i = 1;i<arr.length;i++){
let j = i - 1;
let temp = arr[i];
while (j>=0 && arr[j] > temp) {
arr[j+1] = arr[j];
j–;
}

    num[j+1] =temp;
}

}

let arr =[3,2,1,5 ];

let result = insertSort(arr);