排序算法 | JS

Array.prototype.bubbleSort = function () {
  for(let i = 0; i < this.length - 1; i++){
    for(let j = 0; j < this.length - 1 -i;j += 1) {
      if(this[j] > this[j + 1]) {
        const temp = this[j];
        this[j] = this[j + 1];
        this[j + 1] = temp;
      }
    }
  }
};

const arr = [5, 4, 3, 2, 1];
arr.bubbleSort();
console.log(arr);