javascript中冒泡排序和快速排序的性能比较

var time1 = new Date().getTime();
var arr = [3, 32, 643, 7, 96, 4, 324, 457, 77, 79, 564, 9, 24, 72, 4687, 77, 97, 78, 3423];
//冒泡
function bubbleUp(arr) {
    var arr = arr;
    for (var i = 0; i < arr.length; i++) {
        if (arr[i] > arr[i + 1]) {
            var temp = arr[i];
            arr[i] = arr[i + 1];
            arr[i + 1] = temp;
        }
        for (var j = 0; j < arr.length; j++) {
            if (arr[j] > arr[j + 1]) {
                var temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }
    return arr;
}
console.log(bubbleUp(arr));
var time2 = new Date().getTime();
console.log("times: " + (parseFloat(time2) - parseFloat(time1)));
//快速
var time1 = new Date().getTime();
var arr = [3, 32, 643, 7, 96, 4, 324, 457, 77, 79, 564, 9, 24, 72, 4687, 77, 97, 78, 3423];
var quickSort=function(arr) {
    if (arr.length <= 1) { return arr; }
    var midIndex = Math.floor(arr.length / 2);
    var mid = arr.splice(midIndex, 1)[0];
    var left = new Array();
    var right = new Array();
    for (var i = 0; i < arr.length; i++) {
        if (arr[i] < mid) {
            left.push(arr[i]);
        } else {
            right.push(arr[i]);
        }
    }
    return quickSort(left).concat([mid], quickSort(right));
}
//quickSort(arr);
console.log(quickSort(arr));
var time2 = new Date().getTime();
console.log("times: " + (parseFloat(time2) - parseFloat(time1)));