Nodejs Array Quick Sort quick_sort()

Here you can find the source of quick_sort()

Method Source Code

Array.prototype.quick_sort = function () {
    if (this.length < 2) { return this; }

    var pivot = this[Math.round(this.length / 2)];

    return this.filter(x => x <  pivot)
               .quick_sort()/*from www  . j  a va 2  s.c  o  m*/
               .concat(this.filter(x => x == pivot))
               .concat(this.filter(x => x >  pivot).quick_sort());
};

Related

  1. quickSort()
    Array.prototype.quickSort = function () {
      if (this.length < 2) {
        return this;
      let pivot = this[0];
      let left = [];
      let right = [];
      for (var i = 1; i < this.length; i++) {
        if (this[i] < pivot) {
    ...
    
  2. quickSort()
    Array.prototype.quickSort = function()
      if (this.length === 0) {
        return [];
      var left = [];
      var right = [];
      var pivot = this[0];
      for (var i = 1; i < this.length; i++) {
    ...
    
  3. quickSort()
    Array.prototype.quickSort = function () {
        if (this.length <= 1) {
            return this;
        var pointIndex = Math.floor(this.length / 2);
        var pointValue = this.splice(pointIndex, 1);
        var centerValue = pointValue[0];
        var left = [];
        var right = [];
    ...
    
  4. quickSort(comparator)
    Array.prototype.quickSort = function (comparator) {
      if (typeof comparator !== "function") {
        comparator = function (x, y) {
          if (x === y) {
            return 0;
          } else if (x < y) {
            return -1;
          } else {
            return 1;
    ...
    
  5. quickSort(start, len)
    Array.prototype.quickSort = function(start, len) {
      if (typeof len === "undefined") {
        len = this.length;
      if (len < 2) {
        return this;
    };
    Array.prototype.swap = function (idx1, idx2) {
    ...
    
  6. quick_sort()
    Array.prototype.quick_sort = function () {
        if (this.length < 2) { return this; }
        var pivot = this[Math.round(this.length / 2)];
        return this.filter(x => x < pivot)
                   .quick_sort()
                   .concat(this.filter(x => x === pivot))
                   .concat(this.filter(x => x > pivot).quick_sort());
    };
    
  7. quick_sort()
    Array.prototype.quick_sort = function ()
        if (this.length <= 1)
            return this;
        var pivot = this[Math.round(this.length / 2)];
        return this.filter(function (x) { return x <  pivot }).quick_sort().concat(
               this.filter(function (x) { return x == pivot })).concat(
               this.filter(function (x) { return x >  pivot }).quick_sort());
    
  8. quick_sort()
    Array.prototype.quick_sort = function () {
        if (this.length < 2) { return this; }
        var pivot = this[Math.floor(Math.random() * this.length)];
        return this.filter(x => x <  pivot)
                   .quick_sort()
                   .concat(this.filter(x => x == pivot))
                   .concat(this.filter(x => x >  pivot).quick_sort());
    };
    
  9. qsort(array, begin, end)
    function partition(array, begin, end, pivot)
      var piv=array[pivot];
      array.swap(pivot, end-1);
      var store=begin;
      var ix;
      for(ix=begin; ix<end-1; ++ix) {
        if(array[ix]<=piv) {
          array.swap(store, ix);
    ...