js封装常见快速、选择、冒泡、插入、希尔排序算法

      function ArrayList(params) {
        this.arr = [];
        //添加元素
        ArrayList.prototype.insert = function (item) {
          this.arr.push(item);
        };
        //toString
        ArrayList.prototype.toString = function () {
          return this.arr.join("-");
        };
        ArrayList.prototype.show = function () {
          alert(this.toString());
        };
        //交换位置操作
        ArrayList.prototype.swap = function (index1, index2) {
          var temp = this.arr[index1];
          this.arr[index1] = this.arr[index2];
          this.arr[index2] = temp;
        };
        //冒泡排序
        ArrayList.prototype.bubbleSort = function () {
          var length = this.arr.length;
          for (var j = 0; j < length; j++) {
            for (var i = 0; i < length - j; i++) {
              if (this.arr[i] > this.arr[i + 1]) {
                this.swap(i, i + 1);
              }
            }
          }
        };
        //选择排序
        ArrayList.prototype.selectiosSort = function () {
          var length = this.arr.length;
          for (var j = 0; j < length - 1; j++) {
            var min = j;
            for (var i = min + 1; i < length; i++) {
              if (this.arr[min] > this.arr[i]) {
                min = i;
              }
            }
            this.swap(j, min);
          }
        };
        //插入排序
        ArrayList.prototype.insertSort = function () {
          var length = this.arr.length;
          for (var i = 1; i < length; i++) {
            var temp = this.arr[i];
            var j = i;
            while (this.arr[j - 1] > temp && j > 0) {
              this.arr[j] = this.arr[j - 1];
              j--;
            }
            this.arr[j] = temp;
          }
        };
        //希尔排序
        ArrayList.prototype.shellSort = function () {
          var length = this.arr.length;
          var gap = Math.floor(length / 2);
          while (gap >= 1) {
            for (var i = gap; i < length; i++) {
              var temp = this.arr[i];
              var j = i;
              if (this.arr[j - gap] > temp && j > gap - 1) {
                this.arr[j] = this.arr[j - gap];
                j -= gap;
              }
              this.arr[j] = temp;
            }
            gap = Math.floor(gap / 2);
          }
        };
        //找快排枢纽
        ArrayList.prototype.median = function (left, right) {
          var center = Math.floor((left + right) / 2);
          //排完左中
          if (this.arr[center] < this.arr[left]) {
            this.swap(center, left);
          }
          if (this.arr[center] > this.arr[right]) {
            this.swap(center, right);
            if (this.arr[center] < this.arr[left]) {
              this.swap(left, center);
            }
          }
          this.swap(center, right - 1);
          return this.arr[right - 1];
        };
        //快排
        ArrayList.prototype.quickSort = function () {
          this.quick(0, this.arr.length - 1);
        };
        ArrayList.prototype.quick = function (left, right) {
          if (right > left) {
            var pivot = this.median(left, right);
            var i = left;
            var j = right - 1;
            while (j > i) {
              while (this.arr[++i] < pivot) {}
              while (this.arr[--j] > pivot) {}
              if (j > i) {
                this.swap(i, j);
              }
            }
            this.swap(i, right - 1);
            this.quick(left, i - 1);
            this.quick(i + 1, right);
          }
        };
      }