排序算法总结

冒泡排序

class ArrayList {
      constructor() {
        this.arr = []
      }
      insert(element) {
        this.arr.push(element)
      }
      toString() {
        return this.arr.join('*')
      }
      bubblesort() {
        for (var j = 0; j < this.arr.length-1; j++) {
          for (var i = 0; i < this.arr.length-j-1; i++) {
            if (this.arr[i] > this.arr[i + 1]) {
              var temp = this.arr[i]
              this.arr[i] = this.arr[i + 1]
              this.arr[i + 1] = temp
            }
          }
        }

      }
    }
    let a = new ArrayList()
    a.insert(2)
    a.insert(32)
    a.insert(-4)
    a.insert(523)
    a.insert(5)
    a.bubblesort()
    alert(a.toString()

O(n2)