Very fast sorting for Javascript - inlined swap is a bit faster

quickSort.js

const quickSort = (function() {
    var i = 0;
  
    function swap(first, second, array) {
      var temp = array[first];
      array[first] = array[second];
      array[second] = temp;
    }
    return function(array) {
      for (var len = array.length - 1; i < len; i++) {
        if (array[i] > array[i + 1]) {
          swap(i, i + 1, array);
          i = -1;
        }
      }
      return array;
    };
  })();
  
  

quickSort.min.js

const quickSort=(()=>{let a=0;return (b)=>{for(const e=b.length-1;a<e;a++)if(b[a]>b[a+1]){const d=a+1,c=b,f=c[a];c[a]=c[d];c[d]=f;a=-1}return b}})();

quickSortInlined.js

var quickSortI = (function() {
    var i = 0,
        temp = 0;
    return function(array) {
        for (var len = array.length - 1; i < len; i++) {
            if (array[i] > array[i + 1]) {
                temp = array[i];
                array[i] = array[i + 1];
                array[i + 1] = temp;
                i = -1;
            }
        }
        return array;
    };
})();

quickSortInlined.min.js

var quickSortI=(function(){var i=0,temp=0;return function(array){for(var len=array.length-1;i<len;i++){if(array[i]>array[i+1]){temp=array[i];array[i]=array[i+1];array[i+1]=temp;i=-1}}
return array}})()