js冒泡排序和快速排序

1.冒泡排序

function bubbleSort(data){
    var l = data.length,
        temp;
    for(var i=0; i<l; i++){
        for(var j=l-1; j>=0; j--){
            if(data[j] < data[j-1]){
                temp = data[j];
                data[j] = data[j-1];
                data[j-1] = temp;
            }
        }
    }
    return data;
}
var arr=[1,34,65,8,5,4,3,87,45,-34];
bubbleSort(arr);
//[-34, 1, 3, 4, 5, 8, 34, 45, 65, 87]

时间复杂度 O(n ² )

2.快速排序

function quickSort(data){
    var l = data.length,
        d = data[0],
        x = [],
        y = [];
    if(l <= 1){
        return data;
    }
    for(var i=1; i<l; i++){
        if(data[i] < d){
            x.push(data[i]);
        }else{
            y.push(data[i]);
        }
    }
    x = quickSort(x);
    y = quickSort(y);
    return x.concat([d]).concat(y);
}
var arr=[1,34,65,8,5,4,3,87,45,-34];
quickSort(arr);
//[-34, 1, 3, 4, 5, 8, 34, 45, 65, 87]

时间复杂度 O(n*log₂n)~O(n²)