js算法之排序

/* 斐那其列数列 */
function fn(n){
    if(n <= 0){
        return 0;
    }else if(n == 1){
        return 1
    }else{
        return fn(n-1)+fn(n-2);
    }
   }
//console.log("aa:",fn(1));
   

/* 冒泡 */
function bubbleSort(list){
    var data = list.slice(0)
    var length = data.length
    for(let i = 0 ;i<length;i++){
        for(let j = 0 ; j<length-1-i;j++){
            if(data[j]>data[j+1]){
                //交换
                let buf = data[j]
                data[j] = data[j+1]
                data[j+1] = buf
            }
        }
    }
    return data
}

/* selection */
function selectionSort(list){
    var data = list.slice(0)
    var length = data.length
    for(let i=0 ;i<length ;i++){
        let min = i
        for(let j=i ; j<length;j++){
            if(data[min]>data[j]){
                min = j
            }
        }
        let buf = data[i]
        data[i] = data[min]
        data[min] = buf
    }
    return data
}

/* 插入排序 */
function insertSort(list){
    var data = list.slice(0)
    var length = data.length
    for(let i = 0;i< length-1; i++){
        var current = data[i+1]
        let j =i
        while(j>0){
            if(data[j]>current){
               data[j+1]=data[j]
               j--
            }else{
                break;
            }
        } 
        data[j+1] = current
    }
    return data
}



/* 快速排序 */
function fastSort(list){
    var data = list.slice(0)
    if(data.length<=1)return data
    var index = Math.floor(data.length/2)
    var baseValue = data.splice(index,1)[0]
    var left = []
    var right = []
    data.forEach(element => {
        if(element<baseValue) left.push(element)
        else right.push(element)
    });
    return fastSort(left).concat(baseValue,fastSort(right))
}

var arr = [-2,14,6,2,3,1,5,-1,2.5]
console.log("原数组：",arr)
console.log("冒泡排序   O(n²) ：",bubbleSort(arr));
console.log("选择排序   O(n²) ：",selectionSort(arr));
console.log("插入排序   O(n²) : ",insertSort(arr));
console.log("快速排序  O(nlogn) ",fastSort(arr));
console.log(arr);