JavaScript实现各种排序算法

function bubbleSort(arr) {
       console.time("冒泡排序")var num = 0;
            for (var i = arr.length; i > num; num++) {
                for (var j = i - 1; j > num; j--) {
                    if(arr[j-1]>arr[j]){
                    var temp = arr[j-1];
                    arr[j-1] = arr[j];
                    arr[j] = temp;
                  }
                }
            }
        console.timeEnd("冒泡排序")
        return arr
   }
   var arr = [12, 290, 219, 278, 4432,21, 43, 89, 78];
   console.log( bubbleSort(arr));

function insertSort(arr) {
    console.time("插入排序")

    var len = arr.length;

    if (len <= 1) {
        return arr;
    }

    // 1~n-1趟排序
    arr.map(function(item,index){
      if(index>0){
        for (var j = index; j > 0 && arr[j - 1] > item; j--) {
            arr[j] = arr[j - 1];
        }
        arr[j] = item;
      }
  });
    console.timeEnd("插入排序")
    return arr
}
var arr = [12, 290, 219, 278, 4432, 21, 43, 89, 78];
console.log(insertSort(arr));

function shellSort(arr) {
    console.time("希尔排序")
    var gap, i, j;
    var temp;
    for (gap = arr.length >> 1; gap > 0; gap >>= 1)
        for (i = gap; i < arr.length; i++) {
            temp = arr[i];
            for (j = i - gap; j >= 0 && arr[j] > temp; j -= gap)
                arr[j + gap] = arr[j];
            arr[j + gap] = temp;
        }
    console.timeEnd("希尔排序")
    return arr
}
var arr = [12, 290, 219, 278, 4432, 21, 43, 89, 78];
console.log(shellSort(arr));

12        190  219  278
4432    21    43    89
78
// 第一次排序之后得到：
12      21     43      89
78      190   219    278
4432

// 连接起来得到的是 [12，21，43，89，78，190，219，278，4432]，接着以2为步长 排序之后变为:
12    21
43    89
78    190
219  278
4432

// 然后就是简单的插入排序

function quickSort(arr) {
  return qSort(0,arr.length-1,arr);
}
function qSort(low, high, x) {
    //快速排序
    if (low < high) {
        var povit = partition(low, high, x);

        if (low < povit) qSort(low, povit - 1, x);
        if (povit < high) qSort(povit + 1, high, x)
    }
    return x
}

function partition(low, high, x) {

    if (low == high) return;

    var povit = low;
    var temp = x[povit];
    while (low < high) {
        while (low < high && x[high] < temp) {
            high--;
        }
        if (low != high) {
            x[povit] = x[high];
            povit = high;
            x[povit] = temp;
            low++;
        }
        while (low < high && x[low] > temp) {
            low++;
        }
        if (low != high) {
            x[povit] = x[low];
            povit = low;
            x[povit] = temp;
            high--;
        }
    }

    return povit;
}
var arr = [12, 290, 219, 278, 4432, 21, 43, 89, 78];
console.time("快速排序");
console.log(quickSort(arr));
console.timeEnd("快速排序");