1. //选择
    2. function selection(array) {
    3.     for (let i = 0; i < array.length - 1; i++) {
    4.         let minIndex = i;
    5.         for (let j = i + 1; j < array.length; j++) {
    6.             minIndex = array[j] < array[minIndex] ? j : minIndex;
    7.         }
    8.         swap(array, i, minIndex);
    9.     }
    10.     return array;
    11. }
    12. function insertion(array) {
    13.     for (let i = 1; i < array.length; i++) {
    14.         for (let j = i - 1; j >= 0 && array[j] > array[j + 1]; j--) {
    15.             swap(array, j, j + 1)
    16.         }
    17.     }
    18.     return array;
    19. }
    20. //冒泡排序
    21. function bubble(array) {
    22.     for (let i = array.length - 1; i > 0; i--) {
    23.         for (let j = 0; j < i; j++) {
    24.             if (array[j] > array[j + 1]) swap(array, j, j + 1)
    25.         }
    26.     }
    27. }
    28. function selection(array) {
    29.     for (let i = 0; i < array.length - 1; i++) {
    30.         let minIndex = i;
    31.         for (let j = i + 1; j < array.length; j++) {
    32.             minIndex = array[j] < array[minIndex] ? j : minIndex;
    33.         }
    34.         swap(array, i, minIndex)
    35.     }
    36.     return array;
    37. }
    38. function insertion(array) {
    39.     for (let i = 1; i < array.length; i++) {
    40.         for (let j = i - 1; j >= 0 && array[j] > array[j + 1]; j--) {
    41.             swap(array, j, j + 1)
    42.         }
    43.     }
    44.     return array;
    45. }
    46. let create = function (o) {
    47.     var F = function () { };
    48.     F.prototype = o;
    49.     return new F();
    50. }
    52. // 快排
    53. function quickSort(arr, i, j) {
    54.     if (i < j) {
    55.         let left = i;
    56.         let right = j;
    57.         let prvot = arr[letf];
    58.         while (i < j) {
    59.             while (arr[j] >= pivot && i < j) {
    60.                 j--;
    61.             }
    62.             if (i < j) {
    63.                 arr[i++] = arr[j];
    64.             }
    65.             while (arr[i] <= pivot && i < j) {
    66.                 i++;
    67.             }
    68.             if (i < j) {
    69.                 arr[j--] = arr[i]
    70.             }
    71.         }
    72.         arr[i] = pivot;
    73.         quickSort(arr, left, i - 1);
    74.         quickSort(arr, i + 1, right);
    75.         return arr;
    76.     }
    77. }
    78. function quickSort(arr) {
    79.     if (arr.length <= 1) {
    80.         return arr;
    81.     }
    82.     let pivotIndex = Math.floor(arr.length / 2);
    83.     let pivot = arr.slice(pivotIndex, 1)[0];
    84.     let left = [];
    85.     let right = [];
    86.     arr.forEach(item => {
    87.         if (item > pivot) {
    88.             right.push(item)
    89.         } else {
    90.             left.push(item)
    91.         }
    92.     })
    93.     return quickSort(left).concat([pivot], quickSort(right));
    94. }